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 "segment routing a comprehensive survey of research activities standardization efforts and implementation results"):
  Abstract: Fixed and mobile telecom operators, enterprise network operators and cloud providers strive to face the challenging demands coming from the evolution of IP networks (e.g. huge bandwidth requirements, integration of billions of devices and millions of services in the cloud). Proposed in the early 2010's, the Segment Routing (SR) architecture helps facing these challenging demands and it is being adopted and deployed. The SR architecture is based on the concept of source routing and has interesting scalability properties as it dramatically reduces the amount of state information to be configured in the core nodes to support complex services. The SR architecture has been first implemented with the MPLS dataplane and then, quite recently, with the IPv6 dataplane (SRv6). In this paper we present a tutorial and a comprehensive survey on the SR technology, analyzing research activities, standardization efforts and implementation results. We start with an introduction on the motivations for Segment Routing and an overview of its evolution and standardization. Then, we provide a tutorial on the Segment Routing technology, with focus on the novel SRv6 solution. Next, we thoroughly analyze the research activities according to a taxonomy. We have identified 7 main categories during our analysis of the current state of the art: Traffic Engineering, Failure Recovery, Centrally Controlled Architectures, Path Encoding, Network Programming and Miscellaneous. We also discuss the standardization efforts, providing details on the most important documents and listing other ongoing activities along with pointers to them. Last but not least, we present the up-to-date status of SR implementation and provide references to several open source projects.

Includes members:
  Member "srperf a performance evaluation framework for ipv6 segment routing":
    also connected through other hyperedges:
      (none)
  Member "an efficient linux kernel implementation of service function chaining for legacy vnfs based on ipv6 segment routing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "srperf a performance evaluation framework for ipv6 segment routing")
  Member "node constrained traffic engineering theory and applications":
    also connected through other hyperedges:
      (none)
  Member "sdn architecture and southbound apis for ipv6 segment routing enabled wide area networks":
    also connected through other hyperedges:
      (none)
  Member "flexible failure detection and fast reroute using ebpf and srv6":
    also connected through other hyperedges:
      (none)
  Member "leveraging ebpf for programmable network functions with ipv6 segment routing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "beyond socket options making the linux tcp stack truly extensible")
  Member "centrality based middlepoint selection for traffic engineering with segment routing":
    also connected through other hyperedges:
      (none)
  Member "implementation of virtual network function chaining through segment routing in a linux based nfv infrastructure":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "srperf a performance evaluation framework for ipv6 segment routing")

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)