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: "adversarial models and resilient schemes for network coding"
  Abstract: In a recent paper, Jaggi et al. (INFOCOM 2007), presented a distributed polynomial-time rate-optimal network-coding scheme that works in the presence of Byzantine faults. We revisit their adversarial models and augment them with three, arguably realistic, models. In each of the models, we present a distributed scheme that demonstrates the usefulness of the model. In particular, all of the schemes obtain optimal rate $C-z$, where $C$ is the network capacity and $z$ is a bound on the number of links controlled by the adversary.

Connected through hyperedge HE-1 (induced by source paper "adversarial network coding"):
  with members:
    - "equivalence for networks with adversarial state"
    - "multiple access network information flow and correction codes"
    - "polytope codes against adversaries in networks"
    - "on metrics for error correction in network coding"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"
    - "construction algorithm for network error correcting codes attaining the singleton bound"

Connected through hyperedge HE-2 (induced by source paper "arbitrarily varying networks capacity achieving computationally efficient codes"):
  with members:
    - "coding against a limited view adversary the effect of causality and feedback"
    - "connecting multiple unicast and network error correction reduction and unachievability"
    - "routing for security in networks with adversarial nodes"
    - "polytope codes against adversaries in networks"
    - "network codes resilient to jamming and eavesdropping"
    - "network error correction with unequal link capacities"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-3 (induced by source paper "coding against a limited view adversary the effect of causality and feedback"):
  with members:
    - "network codes resilient to jamming and eavesdropping"

Connected through hyperedge HE-4 (induced by source paper "single source sink network error correction is as hard as multiple unicast"):
  with members:
    - "rateless resilient network coding against byzantine adversaries"
    - "routing for security in networks with adversarial nodes"
    - "an equivalence between network coding and index coding"
    - "on secure network coding with uniform wiretap sets"
    - "polytope codes against adversaries in networks"
    - "robust network coding in the presence of untrusted nodes"
    - "network error correction with unequal link capacities"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-5 (induced by source paper "rateless resilient network coding against byzantine adversaries"):
  with members:
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-6 (induced by source paper "multiple access network information flow and correction codes"):
  with members:
    - "on metrics for error correction in network coding"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

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

Connected through hyperedge HE-8 (induced by source paper "robust network coding in the presence of untrusted nodes"):
  with members:
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

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)