human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "broadcast coded slotted aloha 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 with strict latency constraints. 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 a 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 consider the application of B-CSA to vehicular communications and compare its performance with that of carrier sense multiple access (CSMA), the current MAC protocol in vehicular networks. The results show that B-CSA is able to support a much larger number of users than CSMA with the same reliability.

Connected through hyperedge HE-1 (induced by source paper "finite length analysis of irregular repetition slotted aloha in the waterfall region"):
  with members:
    - "enhancing contention resolution aloha using combining techniques"
    - "finite length analysis of frameless aloha with multi user detection"
    - "on frame asynchronous coded slotted aloha asymptotic finite length and delay analysis"
    - "error floor analysis of coded slotted aloha over packet erasure channels"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "aloha random access that operates as a rateless code"
    - "finite length scaling for iteratively decoded ldpc ensembles"

Connected through hyperedge HE-2 (induced by source paper "unequal error protection in coded slotted aloha"):
  with members:
    - "prioritized random mac optimization via graph based analysis"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "broadcast coded slotted aloha for vehicular communications a finite frame length analysis"
    - "aloha random access that operates as a rateless code"
    - "coded slotted aloha with varying packet loss rate across users"
    - "high throughput random access via codes on graphs coded slotted aloha"

Connected through hyperedge HE-3 (induced by source paper "on frame asynchronous coded slotted aloha asymptotic finite length and delay analysis"):
  with members:
    - "error floor analysis of coded slotted aloha over packet erasure channels"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "spatially coupled random access on graphs"
    - "sliding window based contention resolution diversity slotted aloha"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

Connected through hyperedge HE-4 (induced by source paper "asymptotic and finite frame length analysis of frame asynchronous coded slotted aloha"):
  with members:
    - "error floor analysis of coded slotted aloha over packet erasure channels"
    - "spatially coupled random access on graphs"
    - "sliding window based contention resolution diversity slotted aloha"

Question: Please tell me which class the center node 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)