human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "stealthy communication over adversarially jammed multipath networks"):
  Abstract: We consider the problem of stealth communication over a multipath network in the presence of an active adversary. The multipath network consists of multiple parallel noiseless links, and the adversary is able to eavesdrop and jam a subset of links. We consider two types of jamming --- erasure jamming and overwrite jamming. We require the communication to be both stealthy and reliable, i.e., the adversary should be unable to detect whether or not meaningful communication is taking place, while the legitimate receiver should reconstruct any potential messages from the transmitter with high probability simultaneously. We provide inner bounds on the robust stealth capacities under both adversarial erasure and adversarial overwrite jamming.

Includes members:
  Member "first and second order asymptotics in covert communication":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "keyless covert communication via channel state information")
  Member "embedding covert information in broadcast communications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "undetectable radios covert communication under spectral mask constraints")
  Member "covert communication over adversarially jammed channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "undetectable radios covert communication under spectral mask constraints")
  Member "covert communication over a k user multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "undetectable radios covert communication under spectral mask constraints")
  Member "quadratically constrained myopic adversarial channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "quadratically constrained two way adversarial channels")
  Member "time division is optimal for covert communication over some broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "undetectable radios covert communication under spectral mask constraints")
  Member "sufficiently myopic adversaries are blind":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "authentication against a myopic adversary")
  Member "fundamental limits of communication with low probability of detection":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "keyless covert communication via channel state information")

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