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 "a low complexity recursive approach toward code domain noma for massive communications"):
  Abstract: Nonorthogonal multiple access (NOMA) is a promising technology to meet the demands of the next generation wireless networks on massive connectivity, high throughput and reliability, improved fairness, and low latency. In this context, code-domain NOMA which attempts to serve $K$ users in $M\leq K$ orthogonal resource blocks, using a pattern matrix, is of utmost interest. However, extending the pattern matrix dimensions severely increases the detection complexity and hampers on the significant advantages that can be achieved using large pattern matrices. In this paper, we propose a novel approach toward code-domain NOMA which factorizes the pattern matrix as the Kronecker product of some other factor matrices each with a smaller dimension. Therefore, both the pattern matrix design at the transmitter side and the mixed symbols' detection at the receiver side can be performed over much smaller dimensions and with a remarkably reduced complexity and latency. As a consequence, the system can significantly be overloaded to effectively support the requirements of the next generation wireless networks without any considerable increase on the system complexity.

Includes members:
  Member "practical power balanced non orthogonal multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coherent detection for short packet physical layer network coding with fsk modulation")
  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 "lattice partition multiple access a new method of downlink non orthogonal multiuser transmissions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "on the performance of non orthogonal multiple access in 5g systems with randomly deployed users":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "performance analysis of intelligent reflecting surface assisted noma networks")
  Member "compound polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "design of polar codes for parallel channels with an average power constraint")

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)