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 and amc friends or foes"
  Abstract: To ensure reliable communication in randomly varying and error-prone channels, wireless systems use adaptive modulation and coding (AMC) as well as hybrid ARQ (HARQ). In order to elucidate their compatibility and interaction, we compare the throughput provided by AMC, HARQ, and their combination (AMC-HARQ) under two operational conditions: in slow- and fast block-fading channels. Considering both, incremental redundancy HARQ (HARQ-IR) and repetition redundancy HARQ (HARQ-RR) we optimize the rate-decision regions for AMC/HARQ and compare them in terms of attainable throughput. Under a fairly general model of the channel variation and the decoding functions, we conclude that i) adding HARQ on top of AMC may be counterproductive in the high average signal- to-noise ratio regime for fast fading channels, and ii) HARQ is useful for slow fading channels, but it provides moderate throughput gains. We provide explanations for these results which allow us to propose paths to improve AMC-HARQ systems.

Connected through hyperedge HE-1 (induced by source paper "amc and harq how to increase the throughput"):
  with members:
    - "generalized harq protocols with delayed channel state information and average latency constraints"
    - "how to boost the throughput of harq with off the shelf codes"
    - "adaptive cross packet harq"
    - "delayed channel state information incremental redundancy with backtrack retransmission"
    - "performance of hybrid arq in block fading channels a fixed outage probability analysis"

Connected through hyperedge HE-2 (induced by source paper "adaptive cross packet harq"):
  with members:
    - "how to boost the throughput of harq with off the shelf codes"
    - "rate adaptation for secure harq protocols"
    - "harq buffer management an information theoretic view"
    - "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-3 (induced by source paper "how to boost the throughput of harq with off the shelf codes"):
  with members:
    - "adaptive cross packet harq"
    - "harq buffer management an information theoretic view"
    - "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)