human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "efficient pilot allocation for urllc traffic in 5g industrial iot networks"):
  Abstract: In this paper we address the problem of resource allocation for alarm traffic in industrial Internet of Things networks using massive MIMO. We formulate the general problem of how to allocate pilot signals to alarm traffic such that delivery is guaranteed, while also minimising the number of pilots reserved for alarms, thus maximising the channel resources available for other traffic, such as industrial control traffic. We present an algorithm that fulfils these requirements, and evaluate its performance both analytically and through a simulation study. For realistic alarm traffic characteristics, on average our algorithm can deliver alarms within two time slots (of duration equal to the 5G transmission time interval) using fewer than 1.5 pilots per slot, and even in the worst case it uses around 3.5 pilots in any given slot, with delivery guaranteed in an average of approximately four slots.

Includes members:
  Member "channel hardening in massive mimo a measurement based analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "massive mimo asymptotics for ray based propagation channels")
  Member "sparse signal processing for grant free massive connectivity a future paradigm for random access protocols in the internet of things":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sparse optimization for green edge ai inference")
  Member "random access for massive mimo systems with intra cell pilot contamination":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards massive connectivity support for scalable mmtc communications in 5g networks")
  Member "random access protocol for massive mimo strongest user collision resolution sucr":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "success probability of grant free random access with massive mimo")
  Member "massive mimo for crowd scenarios a solution based on random access":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a random access protocol for pilot allocation in crowded massive mimo systems")
  Member "massive mimo for next generation wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "joint power control and lsfd for wireless powered cell free massive mimo")

Question: Please tell me which class the source paper 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.NI(Networking and Internet Architecture)