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: "covert bits through queues"
  Abstract: We consider covert communication using a queuing timing channel in the presence of a warden. The covert message is encoded using the inter-arrival times of the packets, and the legitimate receiver and the warden observe the inter-departure times of the packets from their respective queues. The transmitter and the legitimate receiver also share a secret key to facilitate covert communication. We propose achievable schemes that obtain non-zero covert rate for both exponential and general queues when a sufficiently high rate secret key is available. This is in contrast to other channel models such as the Gaussian channel or the discrete memoryless channel where only $\mathcal{O}(\sqrt{n})$ covert bits can be sent over $n$ channel uses, yielding a zero covert rate.

Connected through hyperedge HE-1 (induced by source paper "low probability of detection communication opportunities and challenges"):
  with members:
    - "multi antenna covert communications in random wireless networks"
    - "gaussian signalling for covert communications"
    - "achieving covert wireless communications using a full duplex receiver"
    - "multi hop routing in covert wireless networks"
    - "covert wireless communication with a poisson field of interferers"
    - "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-2 (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-3 (induced by source paper "exploiting diversity in molecular timing channels via order statistics"):
  with members:
    - "diversity gain of one shot communication over molecular timing channels"
    - "bits through queues with feedback"
    - "inscribed matter communication part ii"
    - "on the impact of time synchronization in molecular timing channels"
    - "capacity limits of diffusion based molecular timing channels"
    - "a comprehensive survey of recent advancements in molecular communication"
    - "molecular communications channel model and physical layer techniques"
    - "a novel molecular communication system using acids bases and hydrogen ions"

Connected through hyperedge HE-4 (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 communications on poisson packet channels"
    - "lpd communication when the warden does not know when"

Connected through hyperedge HE-5 (induced by source paper "diversity gain of one shot communication over molecular timing channels"):
  with members:
    - "inscribed matter communication part ii"
    - "on the impact of time synchronization in molecular timing channels"
    - "capacity limits of diffusion based molecular timing channels"
    - "a comprehensive survey of recent advancements in molecular communication"
    - "molecular communications channel model and physical layer techniques"
    - "molecular communication in fluid media the additive inverse gaussian noise channel"
    - "nanoscale communication with brownian motion"

Connected through hyperedge HE-6 (induced by source paper "a covert queueing channel in fcfs schedulers"):
  with members:
    - "a covert queueing channel in round robin schedulers"
    - "covert communications on renewal packet channels"
    - "covert communications on poisson packet channels"
    - "quantifying the information leakage in timing side channels in deterministic work conserving schedulers"

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)