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 "on the performance of non orthogonal multiple access in the finite blocklength regime"):
  Abstract: Abstract   In this paper, we present a finite-block-length comparison between the orthogonal multiple access (OMA) scheme and the non-orthogonal multiple access (NOMA) for the uplink channel. First, we consider the Gaussian channel, and derive the closed form expressions for the rate and outage probability. Then, we extend our results to the quasi-static Rayleigh fading channel. Our analysis is based on the recent results on the characterization of the maximum coding rate at finite block-length and finite block-error probability. The overall system throughput is evaluated as a function of the number of information bits, channel uses and power. We find what would be the respective values of these different parameters that would enable throughput maximization. Furthermore, we analyze the system performance in terms of reliability and throughput when applying the type-I ARQ protocol with limited number of retransmissions. The throughput and outage probability are evaluated for different blocklengths and number of information bits. Our analysis reveals that there is a trade-off between reliability and throughput in the ARQ. While increasing the number of retransmissions boosts reliability by minimizing the probability of reception error, it results in more delay which decreases the throughput. Nevertheless, the results show that NOMA always outperforms OMA in terms of throughput, reliability and latency regardless of the users priority or the number of retransmissions in both Gaussian and fading channels.

Includes members:
  Member "on the effective energy efficiency of ultra reliable networks in the finite blocklength regime":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "short packet communications in non orthogonal multiple access systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on energy efficient noma designs for heterogeneous low latency downlink transmissions")
  Member "on the effective capacity of mtc networks in the finite blocklength regime":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "effective capacity and power allocation for machine type communication")
  Member "ultra reliable communication via optimum power allocation for type i arq in finite block length":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "non orthogonal multiple access noma in cellular uplink and downlink challenges and enabling techniques":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "non orthogonal multiple access for 5g and beyond")
  Member "low latency ultra reliable 5g communications finite blocklength bounds and coding schemes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "early detection for optimal latency communications in multi hop links")
  Member "finite block length analysis of the incremental redundancy harq":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "ultra reliable communication in 5g wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")

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.IT(Information Theory)