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 "reliability latency performance of frameless aloha with and without feedback"):
  Abstract: This paper presents a finite length analysis of multi-slot type frameless ALOHA based on a dynamic programming approach. The analysis is exact, but its evaluation is only feasible for short contention periods due to the computational complexity. The analysis is then extended to derive continuous approximations of its key parameters, which, apart from providing an insight into the decoding process, make it possible to estimate the packet error rate with very low computational complexity. Finally, a feedback scheme is presented in which the slot access scheme is dynamically adapted according to the approximate analysis in order to minimize the packet error rate. The results indicate that the introduction of feedback can substantially improve the performance of frameless ALOHA.

Includes members:
  Member "finite length analysis of irregular repetition slotted aloha in the waterfall region":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "protograph ldpc code design for asynchronous random access")
  Member "on the modeling and performance assessment of random access with sic":
    also connected through other hyperedges:
      (none)
  Member "optimized frameless aloha for cooperative base stations with overlapped coverage areas":
    also connected through other hyperedges:
      (none)
  Member "frameless aloha with reliability latency guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "admission control based traffic agnostic delay constrained random access ac dc ra for m2m communication")
  Member "inactivation decoding of lt and raptor codes analysis and code design":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "caching at the edge with lt codes")
  Member "finite length analysis of frameless aloha":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimized frameless aloha for cooperative base stations with overlapped coverage areas")
  Member "on frame asynchronous coded slotted aloha asymptotic finite length and delay analysis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "protograph ldpc code design for asynchronous random access")
  Member "error floor analysis of coded slotted aloha over packet erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar slotted aloha over slot erasure channels")

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)