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 "performance analysis of ultra reliable short message decode and forward relaying protocols"):
  Abstract: Machine-type communication (MTC) is a rapidly growing technology which covers a broad range of automated applications and propels the world into a fully connected society. Two new use cases of MTC are massive MTC (mMTC) and ultra-reliable low latency communication (URLLC), where mMTC supports a large number of devices with high reliability and low rate connectivity while URLLC refers to excessively low outage probability under very stringent latency constraint. Herein, we examine the URLLC through three cooperative schemes, namely dual-hop decode and forward, selection combining, and maximum ratio combining, and compare to direct transmission under Rayleigh fading. We compare the performance of studied cooperative protocols under two distinct power constraints with respect to latency and energy efficiency. Moreover, we illustrate the impact of coding rate on the probability of successful transmission in ultra-reliable region in addition to the effect of power allocation on the outage probability. We also provide the performance analysis of cooperative schemes in terms of energy efficiency and latency requirements.

Includes members:
  Member "network slicing for ultra reliable low latency communication in industry 4 0 scenarios":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ultra reliable and low latency wireless communication tail risk and scale")
  Member "ultra reliable short message cooperative relaying protocols under nakagami m fading":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint power control and rate allocation enabling ultra reliability and energy efficiency in simo wireless networks")
  Member "on the performance of ultra reliable decode and forward relaying under the finite blocklength":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "in band pilot overhead in ultra reliable low latency decode and forward relaying")
  Member "wireless access for ultra reliable low latency communication urllc principles and building blocks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "massive mimo for internet of things iot connectivity")
  Member "ultra reliable communication via optimum power allocation for type i arq in finite block length":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "energy efficient design for tactile internet":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards tactile internet in beyond 5g era recent advances current issues and future directions")
  Member "massive machine type communications in 5g physical and mac layer solutions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "blocklength limited performance of relaying under quasi static rayleigh channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "distributed federated learning for ultra reliable low latency vehicular communications")

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.IT(Information Theory)