human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "connecting multiple unicast and network error correction reduction and unachievability"):
  Abstract: We show that solving a multiple-unicast network coding problem can be reduced to solving a single-unicast network error correction problem, where an adversary may jam at most a single edge in the network. Specifically, we present an efficient reduction that maps a multiple-unicast network coding instance to a network error correction instance while preserving feasibility. The reduction holds for both the zero probability of error model and the vanishing probability of error model. Previous reductions are restricted to the zero-error case. As an application of the reduction, we present a constructive example showing that the single-unicast network error correction capacity may not be achievable, a result of separate interest.

Includes members:
  Member "single source sink network error correction is as hard as multiple unicast":
    also connected through other hyperedges:
      (none)
  Member "routing for security in networks with adversarial nodes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "arbitrarily varying networks capacity achieving computationally efficient codes")
  Member "on network coding for sum networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "linear network coding effects of varying the message dimension on the set of characteristics")
  Member "polytope codes against adversaries in networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "byzantine multiple access")
  Member "robust network coding in the presence of untrusted nodes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "byzantine multiple access")
  Member "network error correction with unequal link capacities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "arbitrarily varying networks capacity achieving computationally efficient codes")
  Member "a rank metric approach to error control in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")
  Member "coding for errors and erasures in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the gap between scalar and vector solutions of generalized combination networks")

Question: Please tell me which class the source paper 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)