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 "downlink non orthogonal multiple access without sic for block fading channels an algebraic rotation approach"):
  Abstract: In this paper, we investigate the problem of downlink non-orthogonal multiple access (NOMA) over block fading channels. For the single antenna case, we propose a class of NOMA schemes where all the users’ signals are mapped into    $n$   -dimensional constellations corresponding to the same algebraic lattices from a number field, allowing every user attains full diversity gain with single-user decoding, i.e., no successive interference cancellation (SIC). The minimum product distances of the proposed scheme with arbitrary power allocation factor are analyzed and their upper bounds are derived. Within the proposed class of schemes, we also identify a special family of NOMA schemes based on lattice partitions of the underlying ideal lattices, whose minimum product distances can be easily controlled. Our analysis shows that among the proposed schemes, the lattice-partition-based schemes achieve the largest minimum product distances of the superimposed constellations, which are closely related to the symbol error rates for receivers with single-user decoding. The simulation results are presented to verify our analysis and to show the effectiveness of the proposed schemes as compared to benchmark NOMA schemes. Extensions of our design to the multi-antenna case are also considered where similar analysis and results are presented.

Includes members:
  Member "multi beam noma for hybrid mmwave systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "optimal resource allocation for power efficient mc noma with imperfect channel state information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "on non orthogonal multiple access with finite alphabet inputs in z channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "a survey on non orthogonal multiple access for 5g networks research challenges and future trends":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "effective capacity of noma with finite blocklength for low latency communications")
  Member "modulation and multiple access for 5g networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity and optimal resource allocation for irs assisted multi user communication systems")
  Member "ergodic fading mimo dirty paper and broadcast channels capacity bounds and lattice strategies":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "when is the achievable rate region convex in two user massive mimo systems")
  Member "sub channel assignment power allocation and user scheduling for non orthogonal multiple access networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "resource allocation in intelligent reflecting surface assisted noma systems")
  Member "lattice partition multiple access a new method of downlink non orthogonal multiuser transmissions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "lattice coding for downlink multiuser transmission")

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)