human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "a scalable approach for service chain mapping with multiple sc instances in a wide area network"
  Abstract: Network function virtualization (NFV) aims to simplify service deployment using virtual network functions (VNFs). Service deployment involves the placement of VNFs and in-sequence routing of traffic flows through VNFs comprising a service chain (SC). The joint VNF placement and traffic routing is called SC mapping. In a wide-area network (WAN), where several traffic flows, generated by many distributed node pairs, require the same SC; a single instance (or occurrence) of that SC might not be enough. SC mapping with multiple SC instances for same SC is a very complex problem, since sequential traversal of VNFs has to be maintained while accounting for traffic flows in various directions. This paper is the first to deal with the problem of SC mapping with multiple SC instances to minimize network resource consumption. We propose an integer linear program (ILP), a column-generation-based ILP (CG-ILP), and a two-phase column-generation-based model (2PhMod) to solve this problem. ILP does not scale to large networks and CG-ILP scalability is limited by quadratic constraints. So, to get results over large network topologies within reasonable computational times, we propose 2PhMod. Using such an approach, we observe that an appropriate choice of only a small set of SC instances leads to a solution very close to minimum bandwidth consumption. Furthermore, this approach also helps us to analyze effects of number of VNF replicas and number of NFV nodes on bandwidth consumption when deploying these minimum number of SC instances.

Connected through hyperedge HE-1 (induced by source paper "robust network function virtualization"):
  with members:
    - "integrated nfv sdn architectures a systematic literature review"
    - "shortest path and maximum flow problems under service function chaining constraints"
    - "service function chaining resource allocation a survey"
    - "an approximation algorithm for path computation and function placement in sdns"
    - "service chain and virtual network embeddings approximations using randomized rounding"
    - "network function virtualization state of the art and research challenges"
    - "fronthaul constrained cloud radio access networks insights and challenges"
    - "lp rounding algorithms for facility location problems"

Connected through hyperedge HE-2 (induced by source paper "placement and routing optimization problem for service function chain state of art and future opportunities"):
  with members:
    - "shortest path and maximum flow problems under service function chaining constraints"
    - "distributed service function chaining"

Connected through hyperedge HE-3 (induced by source paper "on service chaining strategies using virtual network functions in operator networks"):
  with members:
    - "optimal virtual network function placement in multi cloud service function chaining architecture"
    - "network function virtualization state of the art and research challenges"
    - "on orchestrating virtual network functions in nfv"
    - "specifying and placing chains of virtual network functions"
    - "research directions in network service chaining"
    - "resource allocation in a network based cloud computing environment design challenges"

Connected through hyperedge HE-4 (induced by source paper "virtual mobile core placement for metro network"):
  with members:
    - "service chain sc mapping with multiple sc instances in a wide area network"

Question: Please tell me which class the center node 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)