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 "modeling and analysis of uplink non orthogonal multiple access noma in large scale cellular networks using poisson cluster processes"):
  Abstract: Non-orthogonal multiple access (NOMA) serves multiple users by superposing their distinct message signals. The desired message signal is decoded at the receiver by applying successive interference cancellation (SIC). Using the theory of Poisson cluster process (PCP), we provide a framework to analyze multi-cell uplink NOMA systems. Specifically, we characterize the rate coverage probability of a NOMA user who is at rank $m$ (in terms of the distance from its serving BS) among all users in a cell and the mean rate coverage probability of all users in a cell. Since the signal-to-interference-plus-noise ratio (SINR) of $m$-th user relies on efficient SIC, we consider three scenarios, i.e., perfect SIC (in which the signals of $m-1$ interferers who are stronger than $m$-th user are decoded successfully), imperfect SIC (in which the signals of of $m-1$ interferers who are stronger than $m$-th user may or may not be decoded successfully), and imperfect worst case SIC (in which the decoding of the signal of $m$-th user is always unsuccessful whenever the decoding of its relative $m-1$ stronger users is unsuccessful). The derived expressions are customized to capture the performance of a user at rank $m$ in an equivalent orthogonal multiple access (OMA) system. Finally, numerical results are presented to validate the derived expressions.

Includes members:
  Member "fundamentals of cluster centric content placement in cache enabled device to device networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stochastic design and analysis of wireless cloud caching networks")
  Member "non orthogonal multiple access noma in cellular uplink and downlink challenges and enabling techniques":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the performance of non orthogonal multiple access in the finite blocklength regime")
  Member "energy efficiency of distributed signal processing in wireless networks a cross layer analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "downlink non orthogonal multiple access noma in poisson networks")
  Member "modeling and performance analysis of clustered device to device networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimizing joint probabilistic caching and channel access for clustered d2d networks")
  Member "cooperative non orthogonal multiple access with simultaneous wireless information and power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mimo noma networks relying on reconfigurable intelligent surface a signal cancellation based design")
  Member "fairness for non orthogonal multiple access in 5g systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "resource allocation technique for hybrid tdma noma system with opportunistic time assignment")
  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")
  Member "interference statistics and capacity analysis for uplink transmission in two tier small cell networks a geometric probability approach":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the performance of network noma in uplink comp systems a stochastic geometry approach")

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)