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 "single source sink network error correction is as hard as multiple unicast"):
  Abstract: We study the problem of communicating over a single-source single-terminal network in the presence of an adversary that may jam a single link of the network. If any one of the edges can be jammed, the capacity of such networks is well understood and follows directly from the connection between the minimum cut and maximum flow in single-source single- terminal networks. In this work we consider networks in which some edges cannot be jammed, and show that determining the network communication capacity is at least as hard as solving the multiple-unicast network coding problem for the error-free case. The latter problem is a long standing open problem.

Includes members:
  Member "rateless resilient network coding against byzantine adversaries":
    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 "an equivalence between network coding and index coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "embedded index coding")
  Member "on secure network coding with uniform wiretap sets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the equivalency of reliability and security metrics for wireline networks")
  Member "polytope codes against adversaries in networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "byzantine multiple access")
  Member "robust network coding in the presence of untrusted nodes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "byzantine multiple access")
  Member "network error correction with unequal link capacities":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "arbitrarily varying networks capacity achieving computationally efficient codes")
  Member "adversarial models and resilient schemes for network coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "adversarial network coding")

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)