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: "binary causal adversary channels"
  Abstract: In this work 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=(x_1,...,x_n) bit-by-bit over a communication channel. The adversarial jammer can view the transmitted bits x_i one at a time, and can change up to a p-fraction of them. However, the decisions of the jammer must be made in an online or causal manner. Namely, for each bit x_i the jammer's decision on whether to corrupt it or not (and on how to change it) must depend only on x_j for j <= i. This is in contrast to the "classical" adversarial jammer which may base its decisions on its complete knowledge of x. We present a non-trivial upper bound on the amount of information that can be communicated. We show that the achievable rate can be asymptotically no greater than min{1-H(p),(1-4p)^+}. Here H(.) is the binary entropy function, and (1-4p)^+ equals 1-4p for p < 0.25, and 0 otherwise.

Connected through hyperedge HE-1 (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-2 (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"
    - "upper bounds on the capacity of binary channels with causal adversaries"
    - "beating the gilbert varshamov bound for online channels"

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

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

Connected through hyperedge HE-5 (induced by source paper "causal erasure channels"):
  with members:
    - "beating the gilbert varshamov bound for online channels"
    - "codes against online adversaries"

Connected through hyperedge HE-6 (induced by source paper "upper bounds on the capacity of binary channels with causal adversaries"):
  with members:
    - "beating the gilbert varshamov bound for online channels"
    - "explicit capacity achieving codes for worst case additive errors"
    - "codes against online adversaries"
    - "rateless codes for avc models"

Connected through hyperedge HE-7 (induced by source paper "beating the gilbert varshamov bound for online channels"):
  with members:
    - "adversarial models and resilient schemes for network coding"
    - "codes against online adversaries"

Connected through hyperedge HE-8 (induced by source paper "optimal rate code constructions for computationally simple channels"):
  with members:
    - "a characterization of the capacity of online causal binary channels"
    - "beating the gilbert varshamov bound for online channels"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "codes against online adversaries"

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)