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 "optimal and fast real time resources slicing with deep dueling neural networks"):
  Abstract: Effective network slicing requires an infrastructure/network provider to deal with the uncertain demand and real-time dynamics of network resource requests. Another challenge is the combinatorial optimization of numerous resources, e.g., radio, computing, and storage. This article develops an optimal and fast real-time resource slicing framework that maximizes the long-term return of the network provider while taking into account the uncertainty of resource demand from tenants. Specifically, we first propose a novel system model which enables the network provider to effectively slice various types of resources to different classes of users under separate virtual slices. We then capture the real-time arrival of slice requests by a semi-Markov decision process. To obtain the optimal resource allocation policy under the dynamics of slicing requests, e.g., uncertain service time and resource demands, a Q-learning algorithm is often adopted in the literature. However, such an algorithm is notorious for its slow convergence, especially for problems with large state/action spaces. This makes Q-learning practically inapplicable to our case in which multiple resources are simultaneously optimized. To tackle it, we propose a novel network slicing approach with an advanced deep learning architecture, called deep dueling that attains the optimal average reward much faster than the conventional Q-learning algorithm. This property is especially desirable to cope with real-time resource requests and the dynamic demands of users. Extensive simulations show that the proposed framework yields up to 40% higher long-term average return while being few thousand times faster, compared with state of the art network slicing approaches.

Includes members:
  Member "low complexity distributed radio access network slicing algorithms and experimental results":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "constrained network slicing games achieving service guarantees and network efficiency")
  Member "reinforcement learning based qos qoe aware service function chaining in software driven 5g slices":
    also connected through other hyperedges:
      (none)
  Member "slice as an evolutionary service genetic optimization for inter slice resource management in 5g networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")
  Member "optimal slice allocation in 5g core networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "proactive allocation as defense for malicious co residency in sliced 5g core networks")
  Member "network slicing based 5g and future mobile networks mobility resource management and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on machine learning based performance improvement of wireless networks phy mac and network layer")
  Member "statistical multiplexing and traffic shaping games for network slicing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "machine learning for network slicing resource management a comprehensive survey")
  Member "tensorflow large scale machine learning on heterogeneous distributed systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")
  Member "continuous control with deep reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deep reinforcement learning for autonomous driving a survey")

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)