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: "block fading channels with delayed csit at finite blocklength"
  Abstract: In many wireless systems, the channel state information at the transmitter (CSIT) can not be learned until after a transmission has taken place and is thereby outdated. In this paper, we study the benefits of delayed CSIT on a block-fading channel at finite blocklength. First, the achievable rates of a family of codes that allows the number of codewords to expand during transmission, based on delayed CSIT, are characterized. A fixed-length and a variable-length characterization of the rates are provided using the dependency testing bound and the variable-length setting introduced by Polyanskiy et al. Next, a communication protocol based on codes with expandable message space is put forth, and numerically, it is shown that higher rates are achievable compared to coding strategies that do not benefit from delayed CSIT.

Connected through hyperedge HE-1 (induced by source paper "generalized harq protocols with delayed channel state information and average latency constraints"):
  with members:
    - "delayed channel state information incremental redundancy with backtrack retransmission"
    - "the streaming dmt of fading channels"
    - "variable rate retransmissions for incremental redundancy hybrid arq"
    - "on the benefits of partial channel state information for repetition protocols in block fading channels"
    - "completely stale transmitter channel state information is still very useful"

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"
    - "harq buffer management an information theoretic view"
    - "semantic security capacity for wiretap channels of type ii"
    - "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"
    - "harq buffer management an information theoretic view"
    - "delayed channel state information incremental redundancy with backtrack retransmission"
    - "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"
    - "harq buffer management an information theoretic view"
    - "inter frame coding for broadcast communication"
    - "delayed channel state information incremental redundancy with backtrack retransmission"

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)