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 "broadcast coded slotted aloha for vehicular communications a finite frame length analysis"):
  Abstract: We propose an uncoordinated medium access control (MAC) protocol, called all-to-all broadcast coded slotted ALOHA (B-CSA) for reliable all-to-all broadcast in vehicular networks. Unlike unicast coded slotted ALOHA, in B-CSA each user acts as both transmitter and receiver in a half-duplex mode. The half-duplex mode gives rise to a double unequal error protection (DUEP) phenomenon: the more the user repeats its packet, the higher the probability that this packet is decoded by other users, but the lower the probability for this user to decode packets from others. We analyze the performance of B-CSA over the packet erasure channel for a finite frame length. In particular, we provide a general analysis of stopping sets for B-CSA and derive an analytical approximation of the performance in the error floor (EF) region, which captures the DUEP feature of B-CSA. Simulation results reveal that the proposed approximation predicts very well the performance of B-CSA in the EF region. Finally, we compare the proposed B-CSA protocol with carrier sense multiple access (CSMA), the current MAC mechanism in vehicular networks. The results show that B-CSA is able to support a much lager number of users than CSMA with the same reliability.

Includes members:
  Member "all to all broadcast for vehicular networks based on coded slotted aloha":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "random access for massive machine type communications")
  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 "ultra reliable communication in 5g wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "the throughput of slotted aloha with diversity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "enhancing contention resolution aloha using combining techniques")
  Member "aloha random access that operates as a rateless code":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "online estimation and adaptation for random access with successive interference cancellation")
  Member "collision helps algebraic collision recovery for wireless erasure networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sign compute resolve for tree splitting random access")

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)