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 "effective capacity of noma with finite blocklength for low latency communications"):
  Abstract: In this paper, we investigate the link-layer rate of a two-users non-orthogonal multiple access (NOMA) network in finite blocklength (short packet communications) regime, where the two users are paired from a set of V users. The overall reliability consists of the transmission error probability and the queuing delay violation probability. The performance of the two-users NOMA network in finite blocklength is verified for achieving latency and reliability, using the effective capacity (EC) framework. Specifically, we derive closed-form expressions for the EC of the two-users NOMA network in finite blocklength regime, considering transmissions over Rayleigh fading channels. We also study a multiuser NOMA network and derive the total EC of two-users NOMA subsets, and show that the NOMA set with users having distinct channel conditions achieve maximum total EC. Focusing on a two-users NOMA network, we study the impact of the transmit signal-to-noise ratio, delay exponent, and transmission error probability, on the achievable EC of each user. The analysis shows that when the delay exponent is high, the delay violation probability does not improve below a certain value due to the dominant factor of the transmission error probability. The accuracy of the proposed closed-form expressions for the individual EC of a two-users NOMA is verified using the Monte-Carlo simulations.

Includes members:
  Member "on the performance of non orthogonal multiple access in the finite blocklength regime":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "noma versus oma in finite blocklength regime link layer rate performance")
  Member "effective capacity and power allocation for machine type communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "a vision of 6g wireless systems applications trends technologies and open research problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "performance analysis of mobile cellular connected drones under practical antenna configurations")
  Member "ultra reliable and low latency wireless communication tail risk and scale":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimized age of information tail for ultra reliable low latency communications in vehicular networks")
  Member "short packet downlink transmission with non orthogonal multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "performance analysis of noma for ultra reliable and low latency communications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "uplink non orthogonal multiple access over mixed rf fso systems")
  Member "effective capacity in wireless networks a comprehensive survey":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "noma versus oma in finite blocklength regime link layer rate performance")
  Member "power domain non orthogonal multiple access noma in 5g systems potentials and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "mimo noma networks relying on reconfigurable intelligent surface a signal cancellation based design")

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)