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 "online estimation and adaptation for random access with successive interference cancellation"):
  Abstract: This paper proposes an adaptive transmission algorithm for slotted random access systems supporting the successive interference cancellation (SIC) at the access point (AP). When multiple users transmit packets simultaneously in a slot, owing to the SIC technique, the AP is able to decode them through SIC resolve procedures (SRPs), which may occupy multiple consequent slots. While such an SRP could potentially improve the system throughput, how to fully exploit this capability in practical systems is still questionable. In particular, the number of active users contending for the channel varies over time which complicates the algorithm design. By fully exploiting the potential of SIC, the proposed algorithm is designed to maximize the system throughput and minimize the access delay. For this purpose, an online estimation is introduced to estimate the number of active users in real-time and controls their transmissions accordingly. It is shown that the throughput of the proposed algorithm can reach up to 0.693 packets/slot under practical assumptions, which is the first result achieving the throughput limit proved by Yu-Giannakis. It is further shown that the system throughput of 0.559 packets/slot (80.6$\%$ of the throughput limit) is still achievable when the SIC capability is restricted by two.

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 "random noma with cross slot successive interference cancellation packet recovery")
  Member "massive non orthogonal multiple access for cellular iot potentials and limitations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mimo noma networks relying on reconfigurable intelligent surface a signal cancellation based design")
  Member "random access protocols for massive mimo":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "ml estimation and map estimation for device activities in grant free random access with interference")
  Member "coded slotted aloha a graph based method for uncoordinated multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "random noma with cross slot successive interference cancellation packet recovery")
  Member "graph based random access for the collision channel without feedback capacity bound":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "two layer coded channel access with collision resolution design and analysis")

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)