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 "lattice coding for downlink multiuser transmission"):
  Abstract: In this thesis, we mainly investigate the lattice coding problem of the downlink communication between a base station and multiple users. The base station broadcasts a message containing each user's intended message. The capacity limit of such a system setting is already well-known while the design of practical coding and modulation schemes to approach the theoretical limit has not been fully studied and investigated in the literature. This thesis attempts to address this problem by providing a systematic design on lattice coding and modulation schemes for downlink multiuser communication systems. The main idea is to exploit the structure property of lattices to harness interference from downlink users.

Includes members:
  Member "downlink non orthogonal multiple access without sic for block fading channels an algebraic rotation approach":
    also connected through other hyperedges:
      (none)
  Member "joint pilot and payload power control for uplink mimo noma with mrc sic receivers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "random access for massive machine type communications")
  Member "short packet downlink transmission with non orthogonal multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "a multi beam noma framework for hybrid mmwave systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "random access for massive machine type communications")
  Member "optimal resource allocation for power efficient mc noma with imperfect channel state information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "improved decoding and error floor analysis of staircase codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "miscorrection free decoding of staircase codes")
  Member "performance analysis of a hybrid downlink uplink cooperative noma scheme":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "random access for massive machine type communications")
  Member "on non orthogonal multiple access with finite alphabet inputs in z channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "downlink non orthogonal multiple access without sic for block fading channels an algebraic rotation approach")

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)