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: "layered non orthogonal random access with sic and transmit diversity for reliable transmissions"
  Abstract: In this paper, we study a layered random access scheme based on non-orthogonal multiple access (NOMA) to improve the throughput of multichannel ALOHA. At a receiver, successive interference cancellation (SIC) is carried out across layers to remove the signals that are already decoded. A closed- form expression for the total throughput is derived under certain assumptions. It is shown that the transmission rates of layers can be optimized to maximize the total throughput and the proposed scheme can improve the throughput with multiple layers. Furthermore, it is shown that the optimal rates can be recursively found using multiple individual one-dimensional optimizations. We also modify the proposed layered random access scheme with contention resolution repetition diversity for reliable transmissions with a delay constraint. It is shown to be possible to have a low outage probability if the number of copies can be optimized, which is desirable for high reliability low latency communications.

Connected through hyperedge HE-1 (induced by source paper "multichannel aloha with exploration phase"):
  with members:
    - "noma based random access with multichannel aloha"
    - "massive machine type communications in 5g physical and mac layer solutions"
    - "coded random access applying codes on graphs to design random access protocols"
    - "asynchronous code division random access using convex optimization"

Connected through hyperedge HE-2 (induced by source paper "evolutionary game for hybrid uplink noma with truncated channel inversion power control"):
  with members:
    - "on the performance of network noma in uplink comp systems a stochastic geometry approach"
    - "joint power allocation and beamforming for non orthogonal multiple access noma in 5g millimeter wave communications"
    - "noma based random access with multichannel aloha"
    - "noma principles and recent results"
    - "fairness for non orthogonal multiple access in 5g systems"

Connected through hyperedge HE-3 (induced by source paper "noma based compressive random access using gaussian spreading"):
  with members:
    - "sparse signal processing for grant free massive connectivity a future paradigm for random access protocols in the internet of things"
    - "performance of hierarchical sparse detectors for massive mtc"
    - "massive connectivity with massive mimo part i device activity detection and channel estimation"
    - "a variational inference based detection method for repetition coded generalized spatial modulation"
    - "noma based random access with multichannel aloha"
    - "massive machine type communications in 5g physical and mac layer solutions"
    - "on the performance of non orthogonal multiple access in 5g systems with randomly deployed users"
    - "asynchronous code division random access using convex optimization"

Connected through hyperedge HE-4 (induced by source paper "a game theoretic approach for noma aloha"):
  with members:
    - "noma based random access with multichannel aloha"
    - "noma principles and recent results"
    - "a minorization maximization method for optimizing sum rate in the downlink of non orthogonal multiple access systems"
    - "distributed game theoretic optimization and management of multichannel aloha networks"

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)