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: "variable length feedback codes under a strict delay constraint"
  Abstract: We study variable-length feedback (VLF) codes under a strict delay constraint to maximize their average transmission rate (ATR) in a discrete memoryless channel (DMC) while considering periodic decoding attempts. We first derive a lower bound on the maximum achievable ATR, and confirm that the VLF code can outperform non-feedback codes with a larger delay constraint. We show that for a given decoding period, as the strict delay constraint,    $L$  , increases, the gap between the ATR of the VLF code and the DMC capacity scales at most on the order of    $O(L^{-1})$   instead of    $O(L^{-1/2})$   for non-feedback codes as shown in Polyanskiy  et al.  [“Channel coding rate in the finite blocklength regime,”  IEEE Trans. Inf. Theory , vol. 56, no. 5, pp. 2307–2359, May 2010] . We also develop an approximation indicating that, for a given    $L$  , the achievable ATR increases as the decoding period decreases.

Connected through hyperedge HE-1 (induced by source paper "short packet transmission via variable length codes in the presence of noisy stop feedback"):
  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"
    - "reliable transmission of short packets through queues and noisy channels under latency and peak age violation guarantees"
    - "energy latency tradeoff in ultra reliable low latency communication with retransmissions"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "moderate deviation asymptotics for variable length codes with feedback"
    - "coherent multiple antenna block fading channels 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)