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 "novel time asynchronous noma schemes for downlink transmissions"):
  Abstract: Author(s): Ganji, Mehdi; Jafarkhani, Hamid | Abstract: In this work, we investigate the effect of time asynchrony in non-orthogonal multiple access (NOMA) schemes for downlink transmissions. First, we analyze the benefit of adding intentional timing offsets to the conventional power domain-NOMA (P-NOMA). This method which is called Asynchronous-Power Domain-NOMA (AP-NOMA) introduces artificial symbol-offsets between packets destined for different users. It reduces the mutual interference which results in enlarging the achievable rate-region of the conventional P-NOMA. Then, we propose a precoding scheme which fully exploits the degrees of freedom provided by the time asynchrony. We call this multiple access scheme T-NOMA which provides higher degrees of freedom for users compared to the conventional P-NOMA or even the modified AP-NOMA. T-NOMA adopts a precoding at the base station and a linear preprocessing scheme at the receiving user which decomposes the broadcast channel into parallel channels circumventing the need for Successive Interference Cancellation (SIC). The numerical results show that T-NOMA outperforms AP-NOMA and both outperform the conventional P-NOMA. We also compare the maximum sum-rate and fairness provided by these methods. Moreover, the impact of pulse shape and symbol offset on the performance of AP-NOMA and T-NOMA schemes are investigated.

Includes members:
  Member "on the performance of mrc receiver with unknown timing mismatch a large scale analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a new codebook design for analog beamforming in millimeter wave communication")
  Member "interference mitigation using asynchronous transmission and sampling diversity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a new codebook design for analog beamforming in millimeter wave communication")
  Member "the application of mimo to non orthogonal multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "cooperative asynchronous non orthogonal multiple access with power minimization under qos 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)