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 "adaptive cross packet harq"):
  Abstract: In this work, we investigate a coding strategy devised to increase the throughput in hybrid ARQ (HARQ) transmission over block fading channel. In our approach, the transmitter jointly encodes a variable number of bits for each round of HARQ. The parameters (rates) of this joint coding can vary and may be based on the negative acknowledgment (NACK) provided by the receiver or, on the past (outdated) information about the channel states. These new degrees of freedom allow us to improve the match between the codebook and the channel states experienced by the receiver. The results indicate that significant gains can be obtained using the proposed coding strategy, particularly notable when the conventional HARQ fails to offer throughput improvement even if the number of transmission rounds is increased. The new cross-packet HARQ is also implemented using turbo codes where we show that the theoretically predicted throughput gains materialize in practice, and we discuss the implementation challenges.

Includes members:
  Member "how to boost the throughput of harq with off the shelf codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "amc and harq how to increase the throughput")
  Member "harq and amc friends or foes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "amc and harq how to increase the throughput")
  Member "rate adaptation for secure harq protocols":
    also connected through other hyperedges:
      (none)
  Member "harq buffer management an information theoretic view":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dynamic harq with guaranteed delay")
  Member "delayed channel state information incremental redundancy with backtrack retransmission":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "amc and harq how to increase the throughput")
  Member "block fading channels with delayed csit at finite blocklength":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "generalized harq protocols with delayed channel state information and average latency constraints")
  Member "on the benefits of partial channel state information for repetition protocols in block fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fast harq over finite blocklength codes a technique for low latency reliable communication")
  Member "mimo arq with multi bit feedback outage analysis":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "causal predictive imperfect channel state information in block fading channels")

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)