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 "ran slicing for massive iot and bursty urllc service multiplexing analysis and optimization"):
  Abstract: The radio access network (RAN) is regarded as one of the potential proposals for massive Internet of Things (mIoT), where the random access channel (RACH) procedure should be exploited for IoT devices to access to the RAN. However, modelling of the dynamic process of RACH of mIoT devices is challenging. To address this challenge, we first revisit the frame and minislot structure of the RAN. Then, we correlate the RACH request of an IoT device with its queue status and analyze the queue evolution process. Based on the analysis result, we derive the closed-form expression of the RA success probability of the device. Besides, considering the agreement on converging different services onto a shared infrastructure, we further investigate the RAN slicing for mIoT and bursty ultra-reliable and low latency communications (URLLC) service multiplexing. Specifically, we formulate the RAN slicing problem as an optimization one aiming at optimally orchestrating RAN resources for mIoT slices and bursty URLLC slices to maximize the RA success probability and energy-efficiently satisfy bursty URLLC slices' quality-of-service (QoS) requirements. A slice resource optimization (SRO) algorithm exploiting relaxation and approximation with provable tightness and error bound is then proposed to mitigate the optimization problem.

Includes members:
  Member "how should i orchestrate resources of my slices for bursty urllc service provision":
    also connected through other hyperedges:
      (none)
  Member "resource allocation and harq optimization for urllc traffic in 5g wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "5g wireless network slicing for embb urllc and mmtc a communication theoretic view":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "overhead aware design of reconfigurable intelligent surfaces in smart radio environments")
  Member "network slicing to enable scalability and flexibility in 5g mobile networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")
  Member "random access analysis for massive iot networks under a new spatio temporal model a stochastic geometry approach":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "stochastic coalitional games for cooperative random access in m2m communications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "evolutionary games for correlation aware clustering in massive machine to machine networks")
  Member "spatiotemporal stochastic modeling of iot enabled cellular networks scalability and stability analysis":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimizing information freshness in wireless networks a stochastic geometry approach")
  Member "on stochastic geometry modeling of cellular uplink transmission with truncated channel inversion power control":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a spatiotemporal framework for information freshness in iot uplink 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)