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 utility driven multi queue admission control solution for network slicing"
  Abstract: The combination of recent emerging technologies such as network function virtualization (NFV) and network programmability (SDN) gave birth to the Network Slicing revolution. 5G networks consist of multi-tenant infrastructures capable of offering leased network “slices” to new customers (e.g., vertical industries) enabling a new telecom business model: Slice-as-a-Service (SlaaS). In this paper, we aim i) to study the slicing admission control problem by means of a multi-queuing system for heterogeneous tenant requests, ii) to derive its statistical behavior model, and iii) to provide a utility-based admission control optimization. Our results analyze the capability of the proposed SlaaS system to be approximately Markovian and evaluate its performance as compared to legacy solutions.

Connected through hyperedge HE-1 (induced by source paper "machine learning for network slicing resource management a comprehensive survey"):
  with members:
    - "a markov model of slice admission control"
    - "slice as an evolutionary service genetic optimization for inter slice resource management in 5g networks"
    - "rational impatience admission control in 5g sliced networks shall i bide my slice opportunity"
    - "statistical multiplexing and traffic shaping games for network slicing"
    - "a profit maximizing strategy of network resource management for 5g tenant slices"
    - "network slicing games enabling customization in multi tenant networks"

Connected through hyperedge HE-2 (induced by source paper "okpi all kpi network slicing through efficient resource allocation"):
  with members:
    - "getting the most out of your vnfs flexible assignment of service priorities in 5g"
    - "joint service placement and request routing in multi cell mobile edge computing networks"
    - "vnf placement and resource allocation for the support of vertical services in 5g networks"
    - "joint service caching and task offloading for mobile edge computing in dense networks"
    - "jasper joint optimization of scaling placement and routing of virtual network services"
    - "z torch an automated nfv orchestration and monitoring solution"
    - "provably efficient algorithms for joint placement and allocation of virtual network functions"
    - "approximate and incremental network function placement"

Connected through hyperedge HE-3 (induced by source paper "storns stochastic radio access network slicing"):
  with members:
    - "modeling and analysis of cellular networks using stochastic geometry a tutorial"
    - "the intensity matching approach a tractable stochastic geometry approximation to system level analysis of cellular networks"
    - "from network sharing to multi tenancy the 5g network slice broker"
    - "propagation path loss models for 5g urban micro and macro cellular scenarios"
    - "a tractable approach to coverage and rate in cellular networks"

Connected through hyperedge HE-4 (induced by source paper "ran slicing in a uav network for embb service provision"):
  with members:
    - "embb urllc resource slicing a risk sensitive approach"
    - "5g wireless network slicing for embb urllc and mmtc a communication theoretic view"
    - "network slicing based 5g and future mobile networks mobility resource management and challenges"
    - "network slicing to enable scalability and flexibility in 5g mobile networks"
    - "a lyapunov optimization approach to repeated stochastic games"

Connected through hyperedge HE-5 (induced by source paper "multiservice based network slicing orchestration with impatient tenants"):
  with members:
    - "slice as an evolutionary service genetic optimization for inter slice resource management in 5g networks"
    - "from network sharing to multi tenancy the 5g network slice broker"

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)