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 "network coding based protection strategies against a single link failure in optical networks"):
  Abstract: In this paper we develop network protection strategies against a single link failure in optical networks. The motivation behind this work is the fact that %70 of all available links in an optical network suffers from a single link failure. In the proposed protection strategies, denoted NPS-I and NPS-II, we deploy network coding and reduced capacity on the working paths to provide a backup protection path that will carry encoded data from all sources. In addition, we provide implementation aspects and how to deploy the proposed strategies in case of an optical network with n disjoint working paths.

Includes members:
  Member "network protection codes against link failures using network coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy efficient routing and network coding in core networks")
  Member "random linear network coding a free cipher":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "packet loss recovery in broadcast for real time applications in dense wireless networks")
  Member "network coding capacity of random wireless networks under a signal to interference and noise model":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the capacity improvement of multicast traffic with network coding")
  Member "bounds on the network coding capacity for wireless random networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the delay advantage of coding in packet erasure 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)