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 "effective capacity of retransmission schemes a recurrence relation approach"):
  Abstract: We consider the effective capacity performance of retransmission schemes that can involve any combination of multiple transmissions per packet, multiple communication states, or multiple packet communication. We present a novel unified analytical approach, based on a recurrence relation formulation, and give an exact effective capacity expression. The expression is based on the spectral radius of a special block companion matrix given in terms of the state transition probabilities and renewal rate(s). We apply this approach to analyze the performance of hybrid automatic repeat request (HARQ), network-coded ARQ (NC-ARQ), and ARQ operating in a block Gilbert-Elliot channel. We extend the analysis of HARQ to wireless block fading channels, specified by a probability density function, and give closed-form effective capacity expressions of HARQ in general, and of repetition redundancy-HARQ in Rayleigh fading in particular. Finally, we determine the optimal effective capacity, wrt the initial rate, of ARQ, as well as the effective capacity of multilayer-ARQ. Apart from handling a wide class of retransmission schemes, the recurrence relation framework developed for computing the moment-generating function, or moments, may be applicable to other fields of time-series analysis.

Includes members:
  Member "backlog and delay reasoning in harq systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "effective capacity in wireless networks a comprehensive survey")
  Member "finite block length analysis of the incremental redundancy harq":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (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)