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 "coded slotted aloha a graph based method for uncoordinated multiple access"):
  Abstract: In this paper, a random access scheme is introduced, which relies on the combination of packet erasure correcting codes and successive interference cancellation (SIC). The scheme is named coded slotted ALOHA. A bipartite graph representation of the SIC process, resembling iterative decoding of generalized low-density parity-check codes over the erasure channel, is exploited to optimize the selection probabilities of the component erasure correcting codes through a density evolution analysis. The capacity (in packets per slot) of the scheme is then analyzed in the context of the collision channel without feedback. Moreover, a capacity bound is developed, and component code distributions tightly approaching the bound are derived.

Includes members:
  Member "error floor analysis of coded slotted aloha over packet erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polar slotted aloha over slot erasure channels")
  Member "the throughput of slotted aloha with diversity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "enhancing contention resolution aloha using combining techniques")
  Member "aloha random access that operates as a rateless code":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "online estimation and adaptation for random access with successive interference cancellation")
  Member "spatially coupled random access on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reliability latency performance of frameless aloha with and without feedback")
  Member "stable throughput in a cognitive wireless network":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on optimal spectrum access of cognitive relay with finite packet buffer")
  Member "frameless aloha protocol for wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reliability latency performance of frameless aloha with and without feedback")
  Member "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "doubly generalized ldpc codes stability bound over the bec":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "spectral shape of doubly generalized ldpc codes efficient and exact evaluation")

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)