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 "network coded multiple access with high order modulations"):
  Abstract: This paper presents the first network-coded multiple access (NCMA) system prototype operated on high-order modulations up to 16-QAM. NCMA jointly exploits physical-layer network coding (PNC) and multiuser decoding (MUD) to boost throughput of multipacket reception systems. Direct generalization of the existing NCMA decoding algorithm, originally designed for BPSK, to high-order modulations, will lead to huge performance degradation. The throughput degradation is caused by the relative phase offset between received signals from different nodes. To circumvent the phase offset problem, this paper investigates an NCMA system with multiple receive antennas at the access point (AP), referred to as MIMO-NCMA. We put forth a low-complexity symbol-level NCMA decoder that, together with MIMO, can substantially alleviate the performance degradation induced by relative phase offset. To demonstrate the feasibility and advantage of MIMO-NCMA for high-order modulations, we implemented our designs on software-defined radio. Our experimental results show that the throughput of QPSK MIMO-NCMA is double that of both BPSK NCMA and QPSK MUD at SNR=10dB. For higher SNRs at which 16-QAM can be supported, the throughput of MIMO-NCMA can be as high as 3.5 times that of BPSK NCMA. Overall, this paper provides an implementable framework for high-order modulated NCMA.

Includes members:
  Member "on the subtleties of q pam linear physical layer network coding":
    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 "coded random access applying codes on graphs to design random access protocols":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "massive unsourced random access based on uncoupled compressive sensing another blessing of massive mimo")
  Member "uplink non orthogonal multiple access for 5g wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "non orthogonal multiple access for 5g and beyond")
  Member "network coded multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "random access for massive machine type communications")
  Member "constellation mapping for physical layer network coding with m qam modulation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the performance of network coding and forwarding schemes with different degrees of redundancy for wireless mesh networks")
  Member "asynchronous physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an analysis of two user uplink asynchronous non orthogonal multiple access systems")
  Member "random access with physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "random access for massive machine type communications")
  Member "airsync enabling distributed multiuser mimo with full spatial multiplexing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "distributed base station a concept system for long range broadband wireless access")

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)