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 "bounds for energy efficient survivable ip over wdm networks with network coding"):
  Abstract: In this work, we establish analytic bounds for the energy efficiency of 1+1 survivable IP over WDM networks using network coding. The analytic bounds are shown to be in close agreement with our previously reported results. They provide verification of the MILP and heuristics proposed previously, in addition to an efficient, compact means to evaluate network results and allow the performance of large networks to be determined easily.

Includes members:
  Member "software defined optical networks sdons a comprehensive survey":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey of big data machine learning applications optimization in cloud data centers and networks")
  Member "detour planning for fast and reliable failure recovery in sdn with openstate":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on data plane flexibility and programmability in software defined networking")
  Member "network coding based protection strategy against node failures":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "protection over asymmetric channels s mate secure multipath adaptive traffic engineering")
  Member "network protection codes against link failures using network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "energy efficient routing and network coding in core 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.NI(Networking and Internet Architecture)