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 "okpi all kpi network slicing through efficient resource allocation"):
  Abstract: Networks can now process data as well as transporting it; it follows that they can support multiple services, each requiring different key performance indicators (KPIs). Because of the former, it is critical to efficiently allocate network and computing resources to provide the required services, and, because of the latter, such decisions must jointly consider all KPIs targeted by a service. Accounting for newly introduced KPIs (e.g., availability and reliability) requires tailored models and solution strategies, and has been conspicuously neglected by existing works, which are instead built around traditional metrics like throughput and latency. We fill this gap by presenting a novel methodology and resource allocation scheme, named OKpi, which enables high-quality selection of radio points of access as well as VNF (Virtual Network Function) placement and data routing, with polynomial computational complexity. OKpi accounts for all relevant KPIs required by each service, and for any available resource from the fog to the cloud. We prove several important properties of OKpi and evaluate its performance in two real-world scenarios, finding it to closely match the optimum.

Includes members:
  Member "a utility driven multi queue admission control solution for network slicing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "machine learning for network slicing resource management a comprehensive survey")
  Member "getting the most out of your vnfs flexible assignment of service priorities in 5g":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reducing service deployment cost through vnf sharing")
  Member "joint service placement and request routing in multi cell mobile edge computing networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint optimization of service caching placement and computation offloading in mobile edge computing system")
  Member "vnf placement and resource allocation for the support of vertical services in 5g networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "service shifting a paradigm for service resilience in 5g")
  Member "joint service caching and task offloading for mobile edge computing in dense networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cooperative service caching and workload scheduling in mobile edge computing")
  Member "jasper joint optimization of scaling placement and routing of virtual network services":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the softwarised network data zoo")
  Member "z torch an automated nfv orchestration and monitoring solution":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "5g traffic forecasting if verticals and mobile operators cooperate")
  Member "provably efficient algorithms for joint placement and allocation of virtual network functions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "online joint placement and allocation of virtual network functions with heterogeneous servers")

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)