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 "low complexity distributed radio access network slicing algorithms and experimental results"):
  Abstract: Radio access network (RAN) slicing is an effective methodology to dynamically allocate networking resources in 5G networks. One of the main challenges of RAN slicing is that it is provably an NP-Hard problem. For this reason, we design near-optimal low-complexity distributed RAN slicing algorithms. First, we model the slicing problem as a congestion game, and demonstrate that such game admits a unique Nash equilibrium (NE). Then, we evaluate the Price of Anarchy (PoA) of the NE, i.e., the efficiency of the NE as compared to the social optimum, and demonstrate that the PoA is upper-bounded by 3/2. Next, we propose two fully-distributed algorithms that provably converge to the unique NE without revealing privacy-sensitive parameters from the slice tenants. Moreover, we introduce an adaptive pricing mechanism of the wireless resources to improve the network owner's profit. We evaluate the performance of our algorithms through simulations and an experimental testbed deployed on the Amazon EC2 cloud, both based on a real-world dataset of base stations from the OpenCellID project. Results conclude that our algorithms converge to the NE rapidly and achieve near-optimal performance, while our pricing mechanism effectively improves the profit of the network owner.

Includes members:
  Member "equilibrium computation in atomic splittable singleton congestion games":
    also connected through other hyperedges:
      (none)
  Member "from network sharing to multi tenancy the 5g network slice broker":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")
  Member "network slicing games enabling customization in multi tenant networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "machine learning for network slicing resource management a comprehensive survey")
  Member "a survey of anticipatory mobile networking context based classification prediction methodologies and optimization techniques":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "limits lightweight machine learning for iot systems with resource limitations")
  Member "a survey on 5g the next generation of mobile communication":
    also connected through other hyperedges:
      (none)
  Member "distance distributions for real cellular networks":
    also connected through other hyperedges:
      (none)
  Member "emerging technologies and research challenges for 5g wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "blockchain for 5g and beyond networks a state of the art survey")
  Member "distributed learning policies for power allocation in multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a learning approach for low complexity optimization of energy efficiency in multicarrier wireless 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)