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: "on frame asynchronous coded slotted aloha asymptotic finite length and delay analysis"
  Abstract: We consider a frame asynchronous coded slotted ALOHA (FA-CSA) system for uncoordinated multiple access, where users join the system on a slot-by-slot basis according to a Poisson random process and, in contrast to standard frame synchronous CSA (FS-CSA), users are not frame-synchronized. We analyze the performance of FA-CSA in terms of packet loss rate and delay. In particular, we derive the (approximate) density evolution that characterizes the asymptotic performance of FA-CSA when the frame length goes to infinity. We show that, if the receiver can monitor the system before anyone starts transmitting, a boundary effect similar to that of spatially-coupled codes occurs, which greatly improves the iterative decoding threshold. Furthermore, we derive tight approximations of the error floor (EF) for the finite frame length regime, based on the probability of occurrence of the most frequent stopping sets. We show that, in general, FA-CSA provides better performance in both the EF and waterfall regions as compared to FS-CSA. Moreover, FA-CSA exhibits better delay properties than FS-CSA.

Connected through hyperedge HE-1 (induced by source paper "reliability latency performance of frameless aloha with and without feedback"):
  with members:
    - "finite length analysis of irregular repetition slotted aloha in the waterfall region"
    - "on the modeling and performance assessment of random access with sic"
    - "optimized frameless aloha for cooperative base stations with overlapped coverage areas"
    - "frameless aloha with reliability latency guarantees"
    - "inactivation decoding of lt and raptor codes analysis and code design"
    - "finite length analysis of frameless aloha"
    - "error floor analysis of coded slotted aloha over packet erasure channels"
    - "coded random access applying codes on graphs to design random access protocols"

Connected through hyperedge HE-2 (induced by source paper "protograph ldpc code design for asynchronous random access"):
  with members:
    - "enhancing contention resolution aloha using combining techniques"
    - "finite length analysis of irregular repetition slotted aloha in the waterfall region"
    - "random access channel coding in the finite blocklength regime"
    - "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"
    - "low density parity check codes for nonergodic block fading channels"

Connected through hyperedge HE-3 (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"
    - "error floor analysis of coded slotted aloha over packet erasure channels"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "broadcast coded slotted aloha a finite frame length analysis"
    - "aloha random access that operates as a rateless code"
    - "finite length scaling for iteratively decoded ldpc ensembles"

Connected through hyperedge HE-4 (induced by source paper "sparse ofdm a compressive sensing approach to asynchronous neighbor discovery"):
  with members:
    - "massive connectivity with massive mimo part i device activity detection and channel estimation"
    - "detection and combining techniques for asynchronous random access with time diversity"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "probabilistic rateless multiple access for machine to machine communication"
    - "many access channels the gaussian case with random user activities"
    - "asynchronous code division random access using convex optimization"
    - "neighbor discovery in a wireless sensor network multipacket reception capability and physical layer signal processing"
    - "neighbor discovery for wireless networks via compressed sensing"

Connected through hyperedge HE-5 (induced by source paper "stable throughput and delay analysis of a random access network with queue aware transmission"):
  with members:
    - "random access in c ran for user activity detection with limited capacity fronthaul"
    - "relay assisted multiple access with full duplex multi packet reception"
    - "random access protocols with collision resolution in a noncoherent setting"
    - "aloha random access that operates as a rateless code"
    - "a retrial system with two input streams and two orbit queues"
    - "asymptotic stability region of 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)