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 "cooperative asynchronous non orthogonal multiple access with power minimization under qos constraints"):
  Abstract: Recent studies have demonstrated the superiority of non-orthogonal multiple access (NOMA) over orthogonal multiple access (OMA) in cooperative communication networks. In this paper, we propose a novel half-duplex cooperative asynchronous NOMA (C-ANOMA) framework with user relaying, where a timing mismatch is intentionally added in the broadcast signal. We derive the expressions for the individual throughputs of the strong user (acts as relay) which employs the block-wise successive interference cancellation (SIC) and the weak user which combines the symbol-asynchronous signal with the interference-free signal. We analytically prove that in the C-ANOMA systems with a sufficiently large frame length, the strong user attains the same throughput to decode its own message while both users can achieve a higher throughput to decode the weak user's message compared with those in the cooperative NOMA (C-NOMA) systems. Besides, we obtain the optimal timing mismatch when the frame length goes to infinity. Furthermore, to exploit the trade-off between the power consumption of base station and that of the relay user, we solve a weighted sum power minimization problem under quality of services (QoS) constraints. Numerical results show that the C-ANOMA system can consume less power compared with the C-NOMA system to satisfy the same QoS requirements.

Includes members:
  Member "an analysis of two user uplink asynchronous non orthogonal multiple access systems":
    also connected through other hyperedges:
      (none)
  Member "exploiting full half duplex user relaying in noma systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "performance analysis of intelligent reflecting surface assisted noma networks")
  Member "a survey on non orthogonal multiple access for 5g networks research challenges and future trends":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "effective capacity of noma with finite blocklength for low latency communications")
  Member "outage performance for cooperative noma transmission with an af relay":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "performance analysis of intelligent reflecting surface assisted noma networks")
  Member "wireless network level partial relay cooperation a stable throughput analysis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "performance analysis of a cooperative wireless network with adaptive relays")
  Member "interference mitigation using asynchronous transmission and sampling diversity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a new codebook design for analog beamforming in millimeter wave communication")
  Member "cooperative non orthogonal multiple access with simultaneous wireless information and power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mimo noma networks relying on reconfigurable intelligent surface a signal cancellation based design")
  Member "asynchronous orthogonal differential decoding for multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an analysis of two user uplink asynchronous non orthogonal multiple access systems")

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)