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: "harq buffer management an information theoretic view"
  Abstract: A key practical constraint on the design of Hybrid automatic repeat request (HARQ) schemes is the size of the on-chip buffer that is available at the receiver to store previously received packets. In fact, in modern wireless standards such as LTE and LTE-A, the HARQ buffer size is one of the main drivers of the modem area and power consumption. This has recently highlighted the importance of HARQ buffer management, that is, of the use of buffer-aware transmission schemes and of advanced compression policies for the storage of received data. This work investigates HARQ buffer management by leveraging information-theoretic achievability arguments based on random coding. Specifically, standard HARQ schemes, namely Type-I, Chase Combining and Incremental Redundancy, are first studied under the assumption of a finite-capacity HARQ buffer by considering both coded modulation, via Gaussian signaling, and Bit Interleaved Coded Modulation (BICM). The analysis sheds light on the impact of different compression strategies, namely the conventional compression log-likelihood ratios and the direct digitization of baseband signals, on the throughput. Then, coding strategies based on layered modulation and optimized coding blocklength are investigated, highlighting the benefits of HARQ buffer-aware transmission schemes. The optimization of baseband compression for multiple-antenna links is also studied, demonstrating the optimality of a transform coding approach.

Connected through hyperedge HE-1 (induced by source paper "dynamic harq with guaranteed delay"):
  with members:
    - "fast harq over finite blocklength codes a technique for low latency reliable communication"
    - "low latency short packet transmissions fixed length or harq"
    - "ultra reliable and low latency wireless communication tail risk and scale"
    - "ultra reliable low latency cellular networks use cases challenges and approaches"
    - "finite block length analysis of the incremental redundancy harq"
    - "coding versus arq in fading channels how reliable should the phy be"

Connected through hyperedge HE-2 (induced by source paper "rate adaptation for secure harq protocols"):
  with members:
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "adaptive cross packet harq"
    - "semantic security capacity for wiretap channels of type ii"
    - "block fading channels with delayed csit at finite blocklength"
    - "effective secrecy reliability confusion and stealth"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "rethinking the secrecy outage formulation a secure transmission design perspective"

Connected through hyperedge HE-3 (induced by source paper "adaptive cross packet harq"):
  with members:
    - "how to boost the throughput of harq with off the shelf codes"
    - "harq and amc friends or foes"
    - "rate adaptation for secure harq protocols"
    - "delayed channel state information incremental redundancy with backtrack retransmission"
    - "block fading channels with delayed csit at finite blocklength"
    - "on the benefits of partial channel state information for repetition protocols in block fading channels"
    - "mimo arq with multi bit feedback outage analysis"
    - "performance of hybrid arq in block fading channels a fixed outage probability analysis"

Connected through hyperedge HE-4 (induced by source paper "how to boost the throughput of harq with off the shelf codes"):
  with members:
    - "harq and amc friends or foes"
    - "adaptive cross packet harq"
    - "inter frame coding for broadcast communication"
    - "delayed channel state information incremental redundancy with backtrack retransmission"
    - "block fading channels with delayed csit at finite blocklength"

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)