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: "beating the gilbert varshamov bound for online channels"
  Abstract: In the online channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x =(x_1,...,x_n) in {0,1}^n bit by bit via a channel limited to at most pn corruptions. The channel is online in the sense that at the ith step the channel decides whether to flip the ith bit or not and its decision is based only on the bits transmitted so far, i.e., (x_1,...,x_i). This is in contrast to the classical adversarial channel in which the corruption is chosen by a channel that has full knowledge on the sent codeword x. The best known lower bound on the capacity of both the online channel and the classical adversarial channel is the well-known Gilbert-Varshamov bound. In this paper we prove a lower bound on the capacity of the online channel which beats the Gilbert-Varshamov bound for any positive p such that H(2p) < 0.5 (where H is the binary entropy function). To do so, we prove that for any such p, a code chosen at random combined with the nearest neighbor decoder achieves with high probability a rate strictly higher than the Gilbert-Varshamov bound (for the online channel).

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"
    - "binary causal adversary 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"
    - "optimal rate code constructions for computationally simple channels"
    - "binary causal adversary 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"
    - "binary causal adversary channels"

Connected through hyperedge HE-5 (induced by source paper "causal erasure channels"):
  with members:
    - "binary causal adversary 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:
    - "binary causal adversary 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 "optimal rate code constructions for computationally simple channels"):
  with members:
    - "a characterization of the capacity of online causal binary channels"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "binary causal adversary 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)