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 "finite length analysis of irregular repetition slotted aloha in the waterfall region"):
  Abstract: A finite length analysis is introduced for irregular repetition slotted ALOHA (IRSA) that enables to accurately estimate its performance in the moderate-to-high packet loss probability regime, i.e., in the so-called waterfall region. The analysis is tailored to the collision channel model, which enables mapping the description of the successive interference cancellation process onto the iterative erasure decoding of low-density parity-check codes. The analysis provides accurate estimates of the packet loss probability of IRSA in the waterfall region as demonstrated by Monte Carlo simulations.

Includes members:
  Member "enhancing contention resolution aloha using combining techniques":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "protograph ldpc code design for asynchronous random access")
  Member "finite length analysis of frameless aloha with multi user detection":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "irsa transmission optimization via online learning")
  Member "on frame asynchronous coded slotted aloha asymptotic finite length and delay analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reliability latency performance of frameless aloha with and without feedback")
  Member "error floor analysis of coded slotted aloha over packet erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar slotted aloha over slot erasure channels")
  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 "broadcast coded slotted aloha a finite frame length analysis":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "unequal error protection in coded slotted aloha")
  Member "aloha random access that operates as a rateless code":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "online estimation and adaptation for random access with successive interference cancellation")
  Member "finite length scaling for iteratively decoded ldpc ensembles":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec")

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)