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 "random noma with cross slot successive interference cancellation packet recovery"):
  Abstract: Conventional power-domain non-orthogonal multiple access (NOMA) relies on precise power control, which requires real-time channel state information at transmitters. This requirement severely limits its application to future wireless communication systems. To address this problem, we consider NOMA without power allocation, where we exploit the random channel fading and opportunistically perform successive interference cancellation (SIC) detection. To mitigate the multi-user interference, we propose a random NOMA where users randomly transmit their data packets with a certain probability. Then a cross-slot SIC packet recovery scheme is proposed to recover transmitted data packets. We model the cross-slot SIC packet recovery as a Markov process, and provide a throughput analysis, based on which the sum rate is maximized by jointly optimizing the transmission probability and the encoding rate of users.

Includes members:
  Member "maximum sum rate of slotted aloha with successive interference cancellation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online estimation and adaptation for random access with successive interference cancellation")
  Member "noma based random access with multichannel aloha":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "constrained deep reinforcement learning for energy sustainable multi uav based random access iot networks with noma")
  Member "irregular repetition slotted aloha over the rayleigh block fading channel with capture":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fixed symbol aided random access scheme for machine to machine communications")
  Member "maximum sum rate of slotted aloha with capture":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "maximum sum rate of slotted aloha with successive interference cancellation")
  Member "coded slotted aloha a graph based method for uncoordinated multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "phase transition analysis for covariance based massive random access with massive mimo")
  Member "aloha random access that operates as a rateless code":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "online estimation and adaptation for random access with successive interference cancellation")

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)