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 "enhanced multiuser superposition transmission through structured modulation"):
  Abstract: The 5G air interface, namely, dynamic multiple access (MA) based on multiuser superposition transmission (MUST) and orthogonal multiple access (OMA), may require complicated scheduling and heavy signaling overhead. To address these challenges, we propose a a unified MA scheme for future cellular networks, which we refer to as structured multiuser superposition transmission (S-MUST). In S-MUST, we apply complex power allocation coefficients (CPACs) over multiuser legacy constellations to generate a composite constellation. In particular, the in-phase (I) and quadrature (Q) components of the legacy constellation of each user are separately multiplied by those of the CPACs. As such, the CPACs offer an extra degree of freedom for multiplexing users and guarantee fairness in symmetric broadcast channels. This new paradigm of superposition coding allows us to design IQ separation at the user side, which significantly reduces the decoding complexity without degrading performance. Hence, it supports low-complexity frequency-selective scheduling that does not entail dynamically switching between MUST and OMA. We further propose to quantize the CPACs into complex numbers where I and Q components of each quantized coefficient are primes, facilitating parallel interference cancellation at each user via modulo operations, last but not least, we generalize the design of S-MUST to exploit the capabilities of multiantenna base stations. The proposed S-MUST exhibits an improved user fairness with respect to conventional MUST (134% spectral efficiency enhancement) and a lower system complexity compared with dynamically alternating MUST and OMA.

Includes members:
  Member "cell edge aware precoding for downlink massive mimo cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimizing information freshness in wireless networks a stochastic geometry approach")
  Member "uplink sounding reference signal coordination to combat pilot contamination in 5g massive mimo":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "enabling ultra reliable wireless communications for factory automation with distributed mimo")
  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 "the application of mimo to non orthogonal multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "resource allocation technique for hybrid tdma noma system with opportunistic time assignment")
  Member "a general mimo framework for noma downlink and uplink transmission based on signal alignment":
    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 "large system analysis of linear precoding in miso broadcast channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secure regularized zero forcing for multiuser mimome channels")

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)