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 "probabilistic handshake in all to all broadcast coded slotted aloha"):
  Abstract: We propose a probabilistic handshake mechanism for all-to-all broadcast coded slotted ALOHA. We consider a fully connected network where each user acts as both transmitter and receiver in a half-duplex mode. Users attempt to exchange messages with each other and to establish one-to-one handshakes, in the sense that each user decides whether its packet was successfully received by the other users: After performing decoding, each user estimates in which slots the resolved users transmitted their packets and, based on that, decides if these users successfully received its packet. The simulation results show that the proposed handshake algorithm allows the users to reliably perform the handshake. The paper also provides some analytical bounds on the performance of the proposed algorithm which are in good agreement with the simulation results.

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 "all to all broadcast for vehicular networks based on coded slotted aloha":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "random access for massive machine type communications")
  Member "coded random access applying codes on graphs to design random access protocols":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "online estimation and adaptation for random access with successive interference cancellation")
  Member "high throughput random access via codes on graphs coded slotted aloha":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "random access for massive machine type communications")

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)