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: "on the performance of ultra reliable decode and forward relaying under the finite blocklength"
  Abstract: In this paper, we examine the performance of the decode-and-forward (DF) relaying protocols with finite blocklength (FB). We provide the overall outage probability of three distinct DF relaying protocols, where the channels are assumed to be quasi static Rayleigh fading. More importantly, we derive the closed form expressions of the outage probability in the three relaying scenarios. We illustrate protocols where the cooperative communications outperform the direct transmission (DT). In addition, we compare the operating efficiency of the cooperative schemes in the ultra-reliable (UR) region.

Connected through hyperedge HE-1 (induced by source paper "in band pilot overhead in ultra reliable low latency decode and forward relaying"):
  with members:
    - "performance analysis of ultra reliable short message decode and forward relaying protocols"
    - "ultra reliable short message cooperative relaying protocols under nakagami m fading"
    - "delay performance of wireless communications with imperfect csi and finite length coding"
    - "finite block length analysis of the incremental redundancy harq"
    - "optimum pilot overhead in wireless communication a unified treatment of continuous and block fading channels"

Connected through hyperedge HE-2 (induced by source paper "performance analysis of ultra reliable short message decode and forward relaying protocols"):
  with members:
    - "network slicing for ultra reliable low latency communication in industry 4 0 scenarios"
    - "ultra reliable short message cooperative relaying protocols under nakagami m fading"
    - "wireless access for ultra reliable low latency communication urllc principles and building blocks"
    - "ultra reliable communication via optimum power allocation for type i arq in finite block length"
    - "energy efficient design for tactile internet"
    - "massive machine type communications in 5g physical and mac layer solutions"
    - "blocklength limited performance of relaying under quasi static rayleigh channels"
    - "what will 5g be"

Connected through hyperedge HE-3 (induced by source paper "ultra reliable short message cooperative relaying protocols under nakagami m fading"):
  with members:
    - "massive machine type communications in 5g physical and mac layer solutions"
    - "blocklength limited performance of relaying under quasi static rayleigh channels"
    - "what will 5g be"
    - "finite block length analysis of the incremental redundancy harq"
    - "ultra reliable communication in 5g wireless systems"
    - "quasi static multiple antenna fading channels at finite blocklength"

Connected through hyperedge HE-4 (induced by source paper "optimal scheduling of reliability constrained relaying system under outdated csi in the finite blocklength regime"):
  with members:
    - "energy efficient packet scheduling with finite blocklength codes convexity analysis and efficient algorithms"
    - "blocklength limited performance of relaying under quasi static rayleigh channels"
    - "on the capacity of decode and forward relaying over rician fading channels"
    - "finite block length analysis of the incremental redundancy harq"
    - "impact of propagation environment on energy efficient relay placement model and performance analysis"
    - "throughput of cognitive radio systems with finite blocklength codes"
    - "the diversity multiplexing tradeoff of the dynamic decode and forward protocol on a mimo half duplex relay channel"
    - "coding versus arq in fading channels how reliable should the phy be"

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)