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 frameless aloha"):
  Abstract: In this paper we present an exact finite-length analysis#R##N#of frameless ALOHA that is obtained through a dynamical programming approach. Monte Carlo simulations are  performed in order to verify the analysis. Two examples are provided that illustrate how the analysis can be used to optimize the parameters of frameless ALOHA. To the best of the knowledge of the authors, this is the first contribution dealing with an exact finite-length characterization of a protocol from the coded slotted ALOHA family of protocols.

Includes members:
  Member "inactivation decoding analysis for lt codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "bounds on the error probability of raptor codes under maximum likelihood decoding")
  Member "coded slotted aloha a graph based method for uncoordinated multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "phase transition analysis for covariance based massive random access with massive mimo")
  Member "coded random access how coding theory helps to build random access protocols":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wireless access in ultra reliable low latency communication urllc")
  Member "aloha random access that operates as a rateless code":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online estimation and adaptation for random access with successive interference cancellation")
  Member "frameless aloha protocol for wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reliability latency performance of frameless aloha with and without feedback")

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)