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 "coded path protection part 2 design implementation and performance"):
  Abstract: In Part 1 of this paper, we introduced a coding-based proactive network protection scheme, named Coded Path Protection (CPP). In CPP, a backup stream of the primary data is encoded with other data streams, resulting in capacity savings. In addition to being a systematic approach of building valid coding structures, CPP is an optimal and simple capacity placement and coding group formation algorithm. It converts the sharing structure of any solution of a Shared Path Protection (SPP) technique into a coding structure with minimum extra capacity. In this Part 2 of the paper, we describe the implementation of our algorithm using Integer Linear Programming (ILP), its timing and synchronization requirements, and implementation issues in networks. We present simulation results which confirm that CPP provides faster link failure recovery than SPP while it incurs marginal extra capacity beyond that of SPP.

Includes members:
  Member "recovery from link failures in networks with arbitrary topology via diversity coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "link failure recovery over very large arbitrary networks the case of coding")
  Member "overlay protection against link failures using network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy efficient routing and network coding in core networks")
  Member "fast optical layer mesh protection using pre cross connected trails":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal algorithms for near hitless network restoration via diversity 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.NI(Networking and Internet Architecture)