human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "effective capacity in wireless networks a comprehensive survey"):
  with members:
    - "ultra reliable and low latency wireless communication tail risk and scale"
    - "performance analysis of noma for ultra reliable and low latency communications"
    - "wireless access for ultra reliable low latency communication urllc principles and building blocks"
    - "secure transmission of delay sensitive data over wireless fading channels"
    - "energy efficient ofdma networks maintaining statistical qos guarantees for delay sensitive traffic"
    - "statistical qos analysis of full duplex and half duplex heterogeneous cellular networks"
    - "backlog and delay reasoning in harq systems"
    - "delay constrained video transmission quality driven resource allocation and scheduling"

Connected through hyperedge HE-2 (induced by source paper "reliable transmission of short packets through queues and noisy channels under latency and peak age violation guarantees"):
  with members:
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "low latency short packet transmissions fixed length or harq"
    - "5g wireless network slicing for embb urllc and mmtc a communication theoretic view"
    - "delay and peak age violation probability in short packet transmissions"
    - "content based status updates"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "status updates through m g 1 1 queues with harq"
    - "age optimal information updates in multihop networks"

Connected through hyperedge HE-3 (induced by source paper "effective capacity for renewal service processes with applications to harq systems"):
  with members:
    - "effective capacity in wireless networks a comprehensive survey"
    - "asymptotic outage analysis of harq ir over time correlated nakagami m fading channels"
    - "adaptive cross packet harq"
    - "energy efficiency of hybrid arq under statistical queuing constraints"
    - "ultra reliable communication in 5g wireless systems"
    - "effective capacity of delay constrained cognitive radio links exploiting primary feedback"

Connected through hyperedge HE-4 (induced by source paper "outage effective capacity of buffer aided diamond relay systems using harq with incremental redundancy"):
  with members:
    - "backlog and delay reasoning in harq systems"
    - "achievable rates for the fading half duplex single relay selection network using buffer aided relaying"
    - "statistical delay tradeoffs in buffer aided two hop wireless communication systems"
    - "using superposition codebooks and partial decode and forward in low snr parallel relay networks"
    - "buffer aided relaying with adaptive link selection fixed and mixed rate transmission"
    - "broadcast approaches to the diamond channel"

Question: Please tell me which class the center node 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)