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 "noma in the uplink delay analysis with imperfect csi and finite length coding"):
  Abstract: We study whether using non-orthogonal multiple access (NOMA) in the uplink of a mobile network can improve the performance over orthogonal multiple access (OMA) when the system requires ultra-reliable low-latency communications (URLLC). To answer this question, we first consider an ideal system model with perfect channel state information (CSI) at the transmitter and long codewords, where we determine the optimal decoding orders when the decoder uses successive interference cancellation (SIC) and derive closed-form expressions for the optimal rate when joint decoding is used. While joint decoding performs well even under tight delay constraints, NOMA with SIC decoding often performs worse than OMA. For low-latency systems, we must also consider the impact of finite-length channel coding, as well as rate adaptation based imperfect CSI. We derive closed-form approximations for the corresponding outage or error probabilities and find that those effects create a larger performance penalty for NOMA than for OMA. Thus, NOMA with SIC decoding may often be unsuitable for URLLC.

Includes members:
  Member "delay performance of the multiuser miso downlink under imperfect csi and finite length coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "balance queueing and retransmission latency optimal massive mimo design")
  Member "delay performance of wireless communications with imperfect csi and finite length coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "peak age violation guarantees for the transmission of short packets over fading channels")
  Member "on the delay performance of interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "delay violation probability and age of information interplay in the two user multiple access channel")
  Member "fairness for non orthogonal multiple access in 5g systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "resource allocation technique for hybrid tdma noma system with opportunistic time assignment")
  Member "the dispersion of nearest neighbor decoding for additive non gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "coexistence mechanism between embb and urllc in 5g wireless networks")
  Member "on the performance of non orthogonal multiple access in 5g systems with randomly deployed users":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "performance analysis of intelligent reflecting surface assisted noma networks")
  Member "quasi static multiple antenna fading channels at finite blocklength":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "transmission strategies in multiple access fading channels with statistical qos constraints":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "downlink analysis of noma enabled cellular networks with 3gpp inspired user ranking")

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)