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 "simple semi grant free transmission strategies assisted by non orthogonal multiple access"):
  Abstract: Grant-free transmission is an important feature to be supported by future wireless networks since it reduces the signalling overhead caused by conventional grant-based schemes. However, for grant-free transmission, the number of users admitted to the same channel is not caped, which can lead to a failure of multi-user detection. This paper proposes non-orthogonal multiple-access (NOMA) assisted semi-grant-free (SGF) transmission, which is a compromise between grant-free and grant-based schemes. In particular, instead of reserving channels either for grant-based users or grant-free users, we focus on an SGF communication scenario, where users are admitted to the same channel via a combination of grant-based and grant-free protocols. As a result, a channel reserved by a grant-based user can be shared by grant-free users, which improves both connectivity and spectral efficiency. Two NOMA assisted SGF contention control mechanisms are developed to ensure that, with a small amount of signalling overhead, the number of admitted grant-free users is carefully controlled and the interference from the grant-free users to the grant-based users is effectively suppressed. Analytical results are provided to demonstrate that the two proposed SGF mechanisms employing different successive interference cancelation decoding orders are applicable to different practical network scenarios.

Includes members:
  Member "short packet downlink transmission with non orthogonal multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "massive connectivity with massive mimo part ii achievable rate characterization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "faster activity and data detection in massive random access a multi armed bandit approach")
  Member "massive connectivity with massive mimo part i device activity detection and channel estimation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "faster activity and data detection in massive random access a multi armed bandit approach")
  Member "ultra reliable low latency cellular networks use cases challenges and approaches":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "physical layer security for ultra reliable and low latency communications")
  Member "a survey on non orthogonal multiple access for 5g networks research challenges and future trends":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "effective capacity of noma with finite blocklength for low latency communications")
  Member "noma based random access with multichannel aloha":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "constrained deep reinforcement learning for energy sustainable multi uav based random access iot networks with noma")
  Member "optimal joint power and subcarrier allocation for full duplex multicarrier non orthogonal multiple access systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "dynamic user clustering and power allocation for uplink and downlink non orthogonal multiple access noma systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "non orthogonal multiple access with orthogonal time frequency space signal 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)