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: "modern random access for beyond 5g systems a multiple relay aloha perspective"
  Abstract: Modern random access protocols are emerging as an efficient yet simple solution for arising internet of things (IoT) applications in upcoming beyond-5G systems. In this context, both terrestrial and non-terrestrial scenarios can benefit from the presence of multiple low-complexity receivers that act as relays, collecting packets from users and forwarding them towards a central unit. To gain insights on the potential of these setups, we investigate a two-tier slotted ALOHA (SA) multiple-relay system under an erasure channel model. We derive exact end-to-end throughput expressions for an arbitrary number of receivers, and complement our study by discussing the impact of channel impairments. The non-trivial outcome that adding relays is not always beneficial is highlighted and thoughtfully discussed.

Connected through hyperedge HE-1 (induced by source paper "space diversity based grant free random access for critical and non critical iot services"):
  with members:
    - "multiple relay slotted aloha performance analysis and bounds"
    - "information centric grant free access for iot fog networks edge vs cloud detection and learning"
    - "non orthogonal multiplexing of ultra reliable and broadband services in fog radio architectures"
    - "5g wireless network slicing for embb urllc and mmtc a communication theoretic view"
    - "grant free radio access for short packet communications over 5g networks"
    - "grant free radio access iot networks scalability analysis in coexistence scenarios"
    - "two user erasure interference channels with local delayed csit"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"

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)