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 "fast harq over finite blocklength codes a technique for low latency reliable communication"):
  Abstract: This paper studies the performance of delay-constrained hybrid automatic repeat request (HARQ) protocols. Particularly, we propose a fast HARQ protocol where, to increase the end-to-end throughput, some HARQ feedback signals and successive message decodings are omitted. Considering quasi-static channels and a bursty communication model, we derive closed-form expressions for the message decoding probabilities as well as the throughput, the expected delay, and the error probability of the HARQ setups. The analysis is based on the recent results on the achievable rates of finite-length codes and shows the effect of the codeword length on the system performance. Moreover, we evaluate the effect of various parameters, such as imperfect channel estimation and hardware on the system performance. As demonstrated, the proposed fast HARQ protocol reduces the packet transmission delay considerably compared with the state-of-the-art HARQ schemes. For example, with typical message decoding delay profiles and a maximum of 2,…, 5 transmission rounds, the proposed fast HARQ protocol can improve the expected delay compared with standard HARQ by 27%, 42%, 52%, and 60%, respectively, independently of the code rate/fading model.

Includes members:
  Member "mimo channel modeling and capacity analysis for 5g millimeter wave wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the effect of spatial correlation on the performance of uplink and downlink single carrier massive mimo systems")
  Member "modelling decoding errors in harq":
    also connected through other hyperedges:
      (none)
  Member "green communication via power optimized harq protocols":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "asymptotic outage analysis of harq ir over time correlated nakagami m fading channels")
  Member "green communication via type i arq finite block length analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "finite block length analysis of the incremental redundancy harq":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "a tight upper bound for the third order asymptotics for most discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finite sample analysis of image registration")
  Member "millimeter wave channel modeling and cellular capacity evaluation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "coverage analysis of uavs in millimeter wave networks a stochastic geometry approach")
  Member "on the benefits of partial channel state information for repetition protocols in block fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generalized harq protocols with delayed channel state information and average latency constraints")

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)