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 "amc and harq how to increase the throughput"):
  Abstract: In this work, we consider transmissions over block fading channels and assume that adaptive modulation and coding (AMC) and hybrid automatic repeat request (HARQ) are implemented. Knowing that in high signal-to-noise ratio, the conventional combination of HARQ with AMC is counterproductive from the throughput point of view, we adopt the so-called layer-coded HARQ (L-HARQ). L-HARQ allows consecutive packets to share the channel and preserves a great degree of separation between AMC and HARQ; this makes the encoding and decoding very simple and allows us to use the available/optimized codes. Numerical examples shown in the paper indicate that L-HARQ can provide significant throughput gains compared to the conventional HARQ. The L-HARQ is also implemented using turbo codes indicating that the throughput gains also materialize in practice.

Includes members:
  Member "generalized harq protocols with delayed channel state information and average latency constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy latency tradeoff in ultra reliable low latency communication with retransmissions")
  Member "how to boost the throughput of harq with off the shelf codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adaptive cross packet harq")
  Member "harq and amc friends or foes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "adaptive cross packet harq")
  Member "adaptive cross packet harq":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "effective capacity for renewal service processes with applications to harq systems")
  Member "delayed channel state information incremental redundancy with backtrack retransmission":
    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 "performance of hybrid arq in block fading channels a fixed outage probability analysis":
    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)