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 "frameless aloha with reliability latency guarantees"):
  Abstract: One of the novelties brought by 5G is that wireless system design has increasingly turned its focus on guaranteeing reliability and latency. This shifts the design objective of random access protocols from throughput optimization towards constraints based on reliability and latency. For this purpose, we use frameless ALOHA, which relies on successive interference cancellation (SIC), and derive its exact finite-length analysis of the statistics of the unresolved users (reliability) as a function of the contention period length (latency). The presented analysis can be used to derive the reliability-latency guarantees. We also optimize the scheme parameters in order to maximize the reliability within a given latency. Our approach represents an important step towards the general area of design and analysis of access protocols with reliability-latency guarantees.

Includes members:
  Member "finite length analysis of frameless aloha":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reliability latency performance of frameless aloha with and without feedback")
  Member "finite length analysis of frameless aloha with multi user detection":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "finite length analysis of irregular repetition slotted aloha in the waterfall region")
  Member "error floor analysis of coded slotted aloha over packet erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polar slotted aloha over slot erasure channels")
  Member "inactivation decoding analysis for lt codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bounds on the error probability of raptor codes under maximum likelihood decoding")
  Member "coded random access applying codes on graphs to design random access protocols":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "massive unsourced random access based on uncoupled compressive sensing another blessing of massive mimo")
  Member "aloha random access that operates as a rateless code":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (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)