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 "opportunistic relaying without csi optimizing variable rate harq"):
  Abstract: We analyze the opportunistic relaying based on HARQ transmission over the block-fading channel with absence of channel state information (CSI) at the transmitter nodes. We assume that both the source and the relay are allowed to vary their transmission rate bet ween the HARQ transmission rounds. We solve the problem of throughput maximization with respect to the transmission rates using doublerecursive Dynamic Programming. Simplifications are also pr oposed to diminish the complexity of the optimization. The numerical results confirm that the variab le-rate HARQ can increase the throughput significantly comparing to its fixed-rate counterpart.

Includes members:
  Member "on the benefits of partial channel state information for repetition protocols in block fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fast harq over finite blocklength codes a technique for low latency reliable communication")
  Member "lecture notes on network information theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the required number of antennas in a point to point large but finite mimo system outage limited scenario")
  Member "performance of hybrid arq in block fading channels a fixed outage probability analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "short packet transmission via variable length codes in the presence of noisy stop feedback")
  Member "cooperative hybrid arq protocols unified frameworks for protocol analysis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "macro and micro diversity behaviors of practical dynamic decode and forward relaying schemes")

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)