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: "network error correction with unequal link capacities"
  Abstract: This paper studies the capacity of single-source single-sink noiseless networks under adversarial or arbitrary errors on no more than z edges. Unlike prior papers, which assume equal capacities on all links, arbitrary link capacities are considered. Results include new upper bounds, network error correction coding strategies, and examples of network families where our bounds are tight. An example is provided of a network where the capacity is 50% greater than the best rate that can be achieved with linear coding. While coding at the source and sink suffices in networks with equal link capacities, in networks with unequal link capacities, it is shown that intermediate nodes may have to do coding, nonlinear error detection, or error correction in order to achieve the network error correction capacity.

Connected through hyperedge HE-1 (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"
    - "adversarial models and resilient schemes for network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-2 (induced by source paper "connecting multiple unicast and network error correction reduction and unachievability"):
  with members:
    - "single source sink network error correction is as hard as multiple unicast"
    - "routing for security in networks with adversarial nodes"
    - "on network coding for sum networks"
    - "polytope codes against adversaries in networks"
    - "robust network coding in the presence of untrusted nodes"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-3 (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"
    - "adversarial models and resilient schemes for network coding"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-4 (induced by source paper "equivalence for networks with adversarial state"):
  with members:
    - "on the impact of a single edge on the network coding capacity"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"
    - "on the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels"
    - "network coding is zero error always possible"
    - "polytope codes against adversaries in networks"

Connected through hyperedge HE-5 (induced by source paper "network error correction with limited feedback capacity"):
  with members:
    - "polytope codes against adversaries in networks"

Connected through hyperedge HE-6 (induced by source paper "a matroidal framework for network error correcting codes"):
  with members:
    - "refined coding bounds and code constructions for coherent network error correction"
    - "scalar linear solvability of matroidal networks associated with representable matroids"
    - "construction algorithm for network error correcting codes attaining the singleton bound"

Connected through hyperedge HE-7 (induced by source paper "polytope codes against adversaries in networks"):
  with members:
    - "on secure network coding with nonuniform or restricted wiretap sets"
    - "when watchdog meets coding"
    - "an algebraic watchdog for wireless 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)