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 convolutional coding for short blocklengths with decision feedback"
  Abstract: This paper presents a variable-length decision-feedback coding scheme that achieves high rates at short blocklengths. This scheme uses the reliability-output Viterbi algorithm (ROVA) to determine when the receiver's decoding estimate satisfies a given error constraint. We evaluate the performance of both terminated and tail-biting convolutional codes at average blocklengths less than 300 symbols, using the ROVA and the tail-biting ROVA, respectively. Comparing with recent results from finite-blocklength information theory, simulations for both the BSC and the AWGN channel show that the reliability-based decision-feedback scheme can surpass the random-coding lower bound on throughput for feedback codes at some blocklengths less than 100 symbols. This is true both when decoding after every symbol is permitted and when decoding is limited to a small number of increments. Finally, the performance of the reliability-based stopping rule with the ROVA is compared with retransmission decisions based on CRCs. For short blocklengths where the latency overhead of the CRC bits is severe, the ROVA-based approach delivers superior rates.

Connected through hyperedge HE-1 (induced by source paper "low complexity algorithms for transmission of short blocks over the bsc with full feedback"):
  with members:
    - "finite blocklength performance of sequential transmission over bsc with noiseless feedback"
    - "extrinsic jensen shannon divergence applications to variable length coding"
    - "optimal feedback communication via posterior matching"

Connected through hyperedge HE-2 (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"

Connected through hyperedge HE-3 (induced by source paper "convolutionally coded snr adaptive transmission for low latency communications"):
  with members:
    - "a survey on low latency towards 5g ran core network and caching solutions"
    - "design of apsk constellations for coherent optical channels with nonlinear phase noise"

Connected through hyperedge HE-4 (induced by source paper "finite blocklength performance of sequential transmission over bsc with noiseless feedback"):
  with members:
    - "extrinsic jensen shannon divergence applications to variable length coding"
    - "optimal feedback communication via posterior matching"

Connected through hyperedge HE-5 (induced by source paper "efficient error correcting codes in the short blocklength regime"):
  with members:
    - "low complexity joint channel estimation and list decoding of short codes"
    - "low latency short packet transmissions fixed length or harq"
    - "design of polar codes in 5g new radio"
    - "joint design of convolutional code and crc under serial list viterbi decoding"
    - "on the error probability of short concatenated polar and cyclic codes with interleaving"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "polar code construction for list decoding"
    - "ultra sparse non binary ldpc codes for probabilistic amplitude shaping"

Connected through hyperedge HE-6 (induced by source paper "low latency short packet transmissions fixed length or harq"):
  with members:
    - "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"
    - "short packet communications over multiple antenna rayleigh fading channels"

Connected through hyperedge HE-7 (induced by source paper "a systematic approach to incremental redundancy over erasure channels"):
  with members:
    - "update or wait how to keep your data fresh"
    - "on the age of information in status update systems with packet management"
    - "first passage time and large deviation analysis for erasure channels with memory"

Connected through hyperedge HE-8 (induced by source paper "performance of viterbi decoding with and without arq on rician fading channels"):
  with members:
    - "performance of viterbi decoding on interleaved rician fading channels"
    - "on gaussian macs with variable length feedback and non vanishing error probabilities"
    - "green communication via type i arq finite block length analysis"
    - "finite block length analysis of the incremental redundancy harq"
    - "reliability output decoding of tail biting convolutional codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

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)