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 effective capacity of mtc networks in the finite blocklength regime"
  Abstract: This paper analyzes the effective capacity (EC) of delay constrained machine type communication (MTC) networks operating in the finite blocklength (FB) regime. First, we derive a closed-form mathematical approximation for the EC in Rayleigh block fading channels. We characterize the optimum error probability to maximize the concave EC function and study the effect of SINR variations for different delay constraints. Our analysis reveals that SINR variations have less impact on EC for strict delay constrained networks. We present an exemplary scenario for massive MTC access to analyze the interference effect proposing three methods to restore the EC for a certain node which are power control, graceful degradation of delay constraint and joint compensation. Joint compensation combines both power control and graceful degradation of delay constraint, where we perform maximization of an objective function whose parameters are determined according to delay and SINR priorities. Our results show that networks with stringent delay constraints favor power controlled compensation and compensation is generally performed at higher costs for shorter packets.

Connected through hyperedge HE-1 (induced by source paper "on the performance of non orthogonal multiple access in the finite blocklength regime"):
  with members:
    - "on the effective energy efficiency of ultra reliable networks in the finite blocklength regime"
    - "short packet communications in non orthogonal multiple access systems"
    - "ultra reliable communication via optimum power allocation for type i arq in finite block length"
    - "non orthogonal multiple access noma in cellular uplink and downlink challenges and enabling techniques"
    - "low latency ultra reliable 5g communications finite blocklength bounds and coding schemes"
    - "finite block length analysis of the incremental redundancy harq"
    - "ultra reliable communication in 5g wireless systems"
    - "quasi static simo fading channels at finite blocklength"

Connected through hyperedge HE-2 (induced by source paper "effective capacity and power allocation for machine type communication"):
  with members:
    - "short packet communications over multiple antenna rayleigh fading channels"
    - "ultra reliable communication in 5g wireless systems"

Connected through hyperedge HE-3 (induced by source paper "statistical qos provisioning for mtc networks under finite blocklength"):
  with members:
    - "ultra reliable communication via optimum power allocation for type i arq in finite block length"
    - "low latency ultra reliable 5g communications finite blocklength bounds and coding schemes"
    - "blocklength limited performance of relaying under quasi static rayleigh channels"
    - "next generation m2m cellular networks challenges and practical considerations"
    - "ultra reliable communication in 5g wireless systems"
    - "throughput analysis of buffer constrained wireless systems in the finite blocklength regime"

Connected through hyperedge HE-4 (induced by source paper "on the effective energy efficiency of ultra reliable networks in the finite blocklength regime"):
  with members:
    - "ultra reliable communication via optimum power allocation for type i arq in finite block length"
    - "fundamentals of the downlink green coverage and energy efficiency in heterogeneous networks"
    - "power minimization under statistical delay constraints for multi hop wireless industrial networks"
    - "blocklength limited performance of relaying under quasi static rayleigh channels"
    - "ultra reliable communication in 5g wireless systems"

Connected through hyperedge HE-5 (induced by source paper "game theoretic optimization for machine type communications under qos guarantee"):
  with members:
    - "effective capacity analysis in ultra dense wireless networks with random interference"
    - "effective capacity of licensed assisted access in unlicensed spectrum for 5g from theory to application"
    - "on the reliability of lte random access performance bounds for machine to machine burst resolution time"
    - "caching in the sky proactive deployment of cache enabled unmanned aerial vehicles for optimized quality of experience"

Connected through hyperedge HE-6 (induced by source paper "ultra reliable communication via opportunistic arq transmission in cognitive networks"):
  with members:
    - "ultra reliable communication via optimum power allocation for type i arq in finite block length"
    - "ultra reliable communication in 5g wireless systems"

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)