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 "asymptotic regime analysis of noma uplink networks under qos delay constraints"):
  Abstract: In the fifth generation and beyond (B5G) technologies, delay constrains emerge as a topic of particular interest for ultra reliable low latency communications (e.g., enhanced reality, haptic communications). In this report, we study the performance of a two user uplink non orthogonal multiple access (NOMA) network under quality of service (QoS) delay constraints, captured through each user delay exponents in their effective capacity (EC). We propose novel closed form expressions for the EC of the NOMA users and validate them through Monte Carlo simulations. Interestingly, our study shows that in the high signal to noise ratio (SNR) region, the strong NOMA user has a limited EC no matter how large the transmit SNR is, under the same delay constraint as the weak user. We show that for the weak user OMA achieves higher EC than NOMA at small values of the transmit SNR and that NOMA become more beneficial at high values of the transmit SNR. For the strong user, we show that NOMA achieves a higher EC than OMA at small values of the transmit SNR and that at high values of the transmit SNR OMA becomes more beneficial. By introducing user pairing when more than two NOMA users are present, we show that NOMA with user pairing outperforms OMA in term of the total link layer EC. Finally, we find the set of pairs which gives the highest total link-layer in the uplink for NOMA with multiple user-pairs.

Includes members:
  Member "uplink achievable rate for massive mimo systems with low resolution adc":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "performance analysis of noma uplink networks under statistical qos delay constraints")
  Member "effective secrecy reliability confusion and stealth":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stealthy communication over adversarially jammed multipath networks")
  Member "strong secrecy from channel resolvability":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "securing distributed function approximation via coding for continuous compound channels")
  Member "secure communication over fading channels with statistical qos constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secure wireless communication and optimal power control under statistical queueing constraints")

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)