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 "upper bounds on the capacity of binary channels with causal adversaries"):
  Abstract: In this paper, we consider the communication of information in the presence of a causal adversarial jammer. In the setting under study, a sender wishes to communicate a message to a receiver by transmitting a codeword x=(x1, ..., xn) bit-by-bit over a communication channel. The sender and the receiver do not share common randomness. The adversarial jammer can view the transmitted bits xi one at a time and can change up to a p-fraction of them. However, the decisions of the jammer must be made in a causal manner. Namely, for each bit xi, the jammer's decision on whether to corrupt it or not must depend only on xj for j ≤ i. This is in contrast to the “classical” adversarial jamming situations in which the jammer has no knowledge of x, or knows x completely. In this study, we present upper bounds (that hold under both the average and maximal probability of error criteria) on the capacity which hold for both deterministic and stochastic encoding schemes.

Includes members:
  Member "beating the gilbert varshamov bound for online channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sufficiently myopic adversaries are blind")
  Member "binary causal adversary channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sufficiently myopic adversaries are blind")
  Member "explicit capacity achieving codes for worst case additive errors":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "strong secrecy and reliable byzantine detection in the presence of an untrusted relay")
  Member "codes against online adversaries":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sufficiently myopic adversaries are blind")
  Member "rateless codes for avc models":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "quadratically constrained myopic adversarial channels")

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)