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: "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.

Connected through hyperedge HE-1 (induced by source paper "covert communication over adversarially jammed channels"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "quadratically constrained myopic adversarial channels"
    - "second order asymptotics in covert communication"
    - "sufficiently myopic adversaries are blind"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "quantum secure covert communication on bosonic channels"
    - "a characterization of the capacity of online causal binary channels"

Connected through hyperedge HE-2 (induced by source paper "quadratically constrained channels with causal adversaries"):
  with members:
    - "the capacity of online causal q ary error erasure channels"
    - "a characterization of the capacity of online causal binary channels"
    - "causal erasure channels"
    - "on avcs with quadratic constraints"

Connected through hyperedge HE-3 (induced by source paper "sufficiently myopic adversaries are blind"):
  with members:
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "on the capacity of the binary adversarial wiretap channel"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"
    - "coding against a limited view adversary the effect of causality and feedback"
    - "semantic security capacity for wiretap channels of type ii"
    - "the arbitrarily varying wiretap channel deterministic and correlated random coding capacities under the strong secrecy criterion"
    - "a characterization of the capacity of online causal binary channels"

Connected through hyperedge HE-4 (induced by source paper "coding against deletions in oblivious and online models"):
  with members:
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "an improved bound on the fraction of correctable deletions"
    - "a characterization of the capacity of online causal binary channels"
    - "causal erasure channels"
    - "on the zero error capacity threshold for deletion channels"
    - "optimal rate code constructions for computationally simple channels"

Connected through hyperedge HE-5 (induced by source paper "the capacity of online causal q ary error erasure channels"):
  with members:
    - "on the capacity of memoryless adversary"
    - "a characterization of the capacity of online causal binary channels"
    - "causal erasure channels"
    - "beating the gilbert varshamov bound for online channels"
    - "binary causal adversary channels"

Connected through hyperedge HE-6 (induced by source paper "the benefit of a 1 bit jump start and the necessity of stochastic encoding in jamming channels"):
  with members:
    - "a characterization of the capacity of online causal binary channels"
    - "causal erasure channels"

Connected through hyperedge HE-7 (induced by source paper "communication in the presence of a state aware adversary"):
  with members:
    - "sufficiently myopic adversaries are blind"
    - "wiretap channels with random states non causally available at the encoder"
    - "secrecy results for compound wiretap channels"
    - "coding into a source a direct inverse rate distortion theorem"
    - "capacity and random coding exponents for channel coding with side information"

Connected through hyperedge HE-8 (induced by source paper "on the capacity of memoryless adversary"):
  with members:
    - "causal erasure channels"
    - "beating the gilbert varshamov bound for online channels"
    - "optimal rate code constructions for computationally simple channels"
    - "binary causal adversary channels"

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)