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 "statistical qos provisioning for mtc networks under finite blocklength"):
  Abstract: This paper analyzes the effective capacity of delay constrained machine type communication (MTC) networks operating in the finite blocklength regime. First, we derive a closed-form mathematical approximation for the effective capacity in quasi-static Rayleigh fading channels. We characterize the optimum error probability to maximize the concave effective capacity function with reliability constraint and study the effect of signal-to-interference-plus-noise ratio (SINR) variations for different delay constraints. The trade off between reliability and effective capacity maximization reveals that we can achieve higher reliability with limited sacrifice in effective capacity specially when the number of machines is small. Our analysis reveals that SINR variations have less impact on effective capacity 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 effective capacity 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.

Includes members:
  Member "on the effective capacity of mtc networks in the finite blocklength regime":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the performance of non orthogonal multiple access in the finite blocklength regime")
  Member "ultra reliable communication via optimum power allocation for type i arq in finite block length":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "low latency ultra reliable 5g communications finite blocklength bounds and coding schemes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the performance of non orthogonal multiple access in the finite blocklength regime")
  Member "blocklength limited performance of relaying under quasi static rayleigh channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed federated learning for ultra reliable low latency vehicular communications")
  Member "next generation m2m cellular networks challenges and practical considerations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a throughput and energy efficiency scheme for unlicensed massive machine type communications")
  Member "ultra reliable communication in 5g wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "throughput analysis of buffer constrained wireless systems in the finite blocklength regime":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the performance of non orthogonal multiple access in the finite blocklength regime")

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)