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 "blocklength limited performance of relaying under quasi static rayleigh channels"):
  Abstract: In this paper, the blocklength-limited performance of a relaying system is studied, where channels are assumed to experience quasi-static Rayleigh fading while at the same time only the average channel state information (CSI) is available at the source. Both the physical-layer performance (blocklength-limited throughput) and the link-layer performance (effective capacity) of the relaying system are investigated. We propose a simple system operation by introducing a factor based on which we weight the average CSI and let the source determine the coding rate accordingly. We show that both the blocklength-limited throughput and the effective capacity are quasi-concave in the weight factor. Through numerical analysis, we investigate the relaying performance with average CSI while considering perfect CSI scenario and direct transmission as comparison schemes. We observe that relaying is more efficient than direct transmission in the finite blocklength regime. Moreover, this performance advantage of relaying under the average CSI scenario is more significant than under the perfect CSI scenario. Finally, the speed of convergence (between the blocklength-limited performance and the performance with infinite blocklengths) in relaying system is faster in comparison to the direct transmission under both the average CSI scenario and the perfect CSI scenario.

Includes members:
  Member "on the capacity of decode and forward relaying over rician fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a comprehensive performance evaluation of a df based multi hop system over alpha kappa mu and alpha kappa mu extreme fading channels")
  Member "finite block length analysis of the incremental redundancy harq":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "impact of propagation environment on energy efficient relay placement model and performance analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal scheduling of reliability constrained relaying system under outdated csi in the finite blocklength regime")
  Member "quasi static multiple antenna fading channels at finite blocklength":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "the diversity multiplexing tradeoff of the dynamic decode and forward protocol on a mimo half duplex relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "energy efficient resource allocation in machine to machine communications with multiple access and energy harvesting for iot")
  Member "coding versus arq in fading channels how reliable should the phy be":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "short packet transmission via variable length codes in the presence of noisy stop feedback")

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)