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 "effective capacity for renewal service processes with applications to harq systems"):
  Abstract: Considering the widespread use of effective capacity in cross-layer design and the extensive existence of renewal service processes in communication networks, this paper thoroughly investigates the effective capacity for renewal processes. Based on Z-transform, we derive exact analytical expressions for the effective capacity at a given quality of service (QoS) exponent for both the renewal processes with constant reward and with variable rewards. Unlike prior literature that the effective capacity is approximated with no many insightful discussions, our expression is simple and reveals further meaningful results, such as the monotonicity and bounds of effective capacity. The analytical results are then applied to evaluate the cross-layer throughput for diverse hybrid automatic repeat request (HARQ) systems, including fixed-rate HARQ (FR-HARQ, e.g., Type I HARQ, HARQ with chase combining (HARQ-CC) and HARQ with incremental redundancy (HARQ-IR)), variable-rate HARQ (VR-HARQ) and cross-packet HARQ (XP-HARQ). Numerical results corroborate the analytical ones and prove the superiority of our proposed approach. Furthermore, targeting at maximizing the effective capacity via the optimal rate selection, it is revealed that VR-HARQ and XP-HARQ attain almost the same performance, and both of them perform better than FR-HARQ.

Includes members:
  Member "effective capacity in wireless networks a comprehensive survey":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "effective capacity of noma with finite blocklength for low latency communications")
  Member "asymptotic outage analysis of harq ir over time correlated nakagami m fading channels":
    also connected through other hyperedges:
      (none)
  Member "adaptive cross packet harq":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "amc and harq how to increase the throughput")
  Member "effective capacity of retransmission schemes a recurrence relation approach":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "effective capacity in wireless networks a comprehensive survey")
  Member "energy efficiency of hybrid arq under statistical queuing constraints":
    also connected through other hyperedges:
      (none)
  Member "ultra reliable communication in 5g wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "effective capacity of delay constrained cognitive radio links exploiting primary feedback":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the effective capacity of an underwater acoustic channel under impersonation attack")

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)