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 "dynamic harq with guaranteed delay"):
  Abstract: In this paper, a dynamic-hybrid automatic repeat request (D-HARQ) scheme with guaranteed delay performance is proposed. As opposed to the conventional HARQ that the maximum number of re-transmissions, L, is fixed, in the proposed scheme packets can be retransmitted more times given that the previous packet was received with less than L re-transmissions. The dynamic of the proposed scheme is analyzed using the Markov model. For delay-sensitive applications, the proposed scheme shows superior performance in terms of packet error rate compared with the conventional HARQ and Fixed re-transmission schemes when the channel state information is not available at the transmitter. We further show that D-HARQ achieves a higher throughput compared with the conventional HARQ and fixed re-transmission schemes under the same reliability constraint.

Includes members:
  Member "fast harq over finite blocklength codes a technique for low latency reliable communication":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "short packet transmission via variable length codes in the presence of noisy stop feedback")
  Member "low latency short packet transmissions fixed length or harq":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "ultra reliable and low latency wireless communication tail risk and scale":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimized age of information tail for ultra reliable low latency communications in vehicular networks")
  Member "ultra reliable low latency cellular networks use cases challenges and approaches":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "physical layer security for ultra reliable and low latency communications")
  Member "harq buffer management an information theoretic view":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "rate adaptation for secure harq protocols")
  Member "finite block length analysis of the incremental redundancy harq":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "coding versus arq in fading channels how reliable should the phy be":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)