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 "covert communication over adversarially jammed channels"):
  Abstract: We consider a situation in which a transmitter Alice may wish to communicate with a receiver Bob over an adversarial channel. An active adversary James eavesdrops on their communication over a binary symmetric channel (BSC(q)), and may maliciously flip (up to) a certain fraction p of their transmitted bits. The communication should be both covert and reliable. Covertness requires that the adversary James should be unable to estimate whether or not Alice is communicating based on his noisy observations, while reliability requires that the receiver Bob should be able to correctly recover Alice's message with high probability. Unlike the setting with passive adversaries considered thus far in the literature, we show that reliable covert communication in the presence of actively jamming adversaries requires Alice and Bob to have a shared key (unknown to James). The optimal throughput obtainable depends critically on the size of this key: 1) When Alice and Bob's shared key is less than 0.5log(n) bits, no communication that is simultaneously covert and reliable is possible. Conversely, when the shared key is larger than 6log(n), the optimal throughput scales as O(\sqrt{n}) --- we explicitly characterize even the constant factor (with matching inner and outer bounds) for a wide range of parameters of interest. 2) When Alice and Bob have a large amount (\omega(\sqrt{n}) bits) of shared key, we present a tight covert capacity characterization for all parameters of interest. 3) When the size of the shared key is moderate (belongs to (\Omega(log(n)), O(\sqrt{n}))), we show an achievable coding scheme as well as an outer bound on the information-theoretically optimal throughput. 4) When Alice and Bob's shared key is O(\sqrt{n}log(n)) bits, we develop a computationally efficient coding scheme for Alice/Bob whose throughput is only a constant factor smaller than information-theoretically optimal.

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 "quadratically constrained myopic adversarial channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "quadratically constrained two way adversarial channels")
  Member "second order asymptotics in covert communication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exact exponent for soft covering")
  Member "sufficiently myopic adversaries are blind":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "keyless covert communication via channel state information")
  Member "covert communication over noisy channels a resolvability perspective":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "keyless covert communication via channel state information")
  Member "quantum secure covert communication on bosonic channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "stealthy communication over adversarially jammed multipath networks")
  Member "a characterization of the capacity of online causal binary channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "list decoding for oblivious arbitrarily varying macs constrained and gaussian")

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)