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: "high throughput random access via codes on graphs coded slotted aloha"
  Abstract: In this paper, coded slotted ALOHA (CSA) is introduced as a powerful random access scheme to the MAC frame. In CSA, the burst a generic user wishes to transmit in the MAC frame is first split into segments, and these segments are then encoded through a local a packet-oriented code prior to transmission. On the receiver side, iterative interference cancellation combined with decoding of the local code is performed to recover from collisions. The new scheme generalizes the previously proposed irregular repetition slotted ALOHA (IRSA) technique, based on a simple repetition of the users' bursts. An interpretation of the CSA interference cancellation process as an iterative erasure decoding process over a sparse bipartite graph is identified, and the corresponding density evolution equations derived. Based on these equations, asymptotically optimal CSA schemes are designed for several rates and their performance for a finite number of users investigated through simulation and compared to IRSA competitors. Throughputs as high as $0.8$ are demonstrated. The new scheme turns out to be a good candidate in contexts where power efficiency is required

Connected through hyperedge HE-1 (induced by source paper "random access for massive machine type communications"):
  with members:
    - "beamwidth control for noma in hybrid mmwave communication systems"
    - "design of non orthogonal beamspace multiple access for cellular internet of things"
    - "on the performance gain of noma over oma in uplink single cell systems"
    - "multi beam noma for hybrid mmwave systems"
    - "joint pilot and payload power control for uplink mimo noma with mrc sic receivers"
    - "reliability based windowed decoding for spatially coupled ldpc codes"
    - "short packet downlink transmission with non orthogonal multiple access"
    - "a multi beam noma framework for hybrid mmwave systems"

Connected through hyperedge HE-2 (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"
    - "on frame asynchronous coded slotted aloha asymptotic finite length and delay analysis"
    - "error floor analysis of coded slotted aloha over packet erasure channels"

Connected through hyperedge HE-3 (induced by source paper "two layer coded channel access with collision resolution design and analysis"):
  with members:
    - "coded random access applying codes on graphs to design random access protocols"
    - "probabilistic rateless multiple access for machine to machine communication"
    - "scma for downlink multiple access of 5g wireless networks"
    - "near capacity adaptive analog fountain codes for wireless channels"
    - "aloha random access that operates as a rateless code"
    - "graph based random access for the collision channel without feedback capacity bound"

Connected through hyperedge HE-4 (induced by source paper "rate selection and power adaptation using maximal ratio combining for the random access gaussian channel"):
  with members:
    - "enhancing contention resolution aloha using combining techniques"
    - "coded random access applying codes on graphs to design random access protocols"

Connected through hyperedge HE-5 (induced by source paper "a random access protocol for pilot allocation in crowded massive mimo systems"):
  with members:
    - "random access in uplink massive mimo systems how to exploit asynchronicity and excess antennas"
    - "massive mimo ten myths and one critical question"
    - "random access for massive mimo systems with intra cell pilot contamination"
    - "random access protocol for massive mimo strongest user collision resolution sucr"
    - "massive mimo for crowd scenarios a solution based on random access"
    - "three practical aspects of massive mimo intermittent user activity pilot synchronism and asymmetric deployment"
    - "coded random access applying codes on graphs to design random access protocols"
    - "massive mimo systems with non ideal hardware energy efficiency estimation and capacity limits"

Connected through hyperedge HE-6 (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"
    - "broadcast coded slotted aloha a finite frame length analysis"
    - "aloha random access that operates as a rateless code"
    - "coded slotted aloha with varying packet loss rate across users"

Connected through hyperedge HE-7 (induced by source paper "coding for network coded slotted aloha"):
  with members:
    - "linearly coupled fountain codes"
    - "batched sparse codes"
    - "an algebraic approach to physical layer network coding"
    - "network coded multiple access"
    - "frameless aloha protocol for wireless networks"
    - "physical layer network coding tutorial survey and beyond"
    - "channel coding and decoding in a relay system operated with physical layer network coding"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-8 (induced by source paper "probabilistic handshake in all to all broadcast coded slotted aloha"):
  with members:
    - "error floor analysis of coded slotted aloha over packet erasure channels"
    - "all to all broadcast for vehicular networks based on coded slotted aloha"
    - "coded random access applying codes on graphs to design random access protocols"
    - "aloha random access that operates as a rateless code"

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)