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 "centrality based middlepoint selection for traffic engineering with segment routing"):
  Abstract: Segment routing is an emerging technology to simplify traffic engineering implementation in WANs. It expresses an end-to-end logical path as a sequence of segments through a set of middlepoints. Traffic along each segment is routed along shortest paths. In this paper, we study practical traffic engineering (TE) with segment routing in SDN based WANs. We consider two common types of TE, and show that the TE problem can be solved in weakly polynomial time when the number of middlepoints is fixed and not part of the input. However, the corresponding linear program is of large scale and computationally expensive. For this reason, existing methods that work by taking each node as a candidate middlepoint are inefficient. Motivated by this, we propose to select just a few important nodes as middlepoints for all traffic. We use node centrality concepts from graph theory, notably group shortest path centrality, for middlepoint selection. Our performance evaluation using realistic topologies and traffic traces shows that a small percentage of the most central nodes can achieve good results with orders of magnitude lower runtime.

Includes members:
  Member "online admission control and embedding of service chains":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robust online composition routing and nf placement for nfv enabled services")
  Member "incremental deployment of network monitors based on group betweenness centrality":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "current flow group closeness centrality for complex 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)