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: "reliability output decoding of tail biting convolutional codes"
  Abstract: We present extensions to Raghavan and Baum's reliability-output Viterbi algorithm (ROVA) to accommodate tail-biting convolutional codes. These tail-biting reliability-output algorithms compute the exact word-error probability of the decoded codeword after first calculating the posterior probability of the decoded tail-biting codeword's starting state. One approach employs a state-estimation algorithm that selects the maximum a posteriori state based on the posterior distribution of the starting states. Another approach is an approximation to the exact tail-biting ROVA that estimates the word-error probability. A comparison of the computational complexity of each approach is discussed in detail. The presented reliability-output algorithms apply to both feedforward and feedback tail-biting convolutional encoders. These tail-biting reliability-output algorithms are suitable for use in reliability-based retransmission schemes with short blocklengths, in which terminated convolutional codes would introduce rate loss.

Connected through hyperedge HE-1 (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-2 (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"
    - "variable length convolutional coding for short blocklengths with decision feedback"
    - "green communication via type i arq finite block length analysis"
    - "finite block length analysis of the incremental redundancy harq"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-3 (induced by source paper "code design for short blocks a survey"):
  with members:
    - "coded random access applying codes on graphs to design random access protocols"
    - "advanced channel coding for space mission telecommand links"
    - "five disruptive technology directions for 5g"
    - "list decoding of polar codes"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "multiple bases belief propagation decoding of high density cyclic codes"
    - "accumulate repeat accumulate codes capacity achieving ensembles of systematic codes for the erasure channel with bounded complexity"
    - "channel coding the road to channel capacity"

Connected through hyperedge HE-4 (induced by source paper "optimizing transmission lengths for limited feedback with non binary ldpc examples"):
  with members:
    - "isn t hybrid arq sufficient"
    - "protograph based raptor like ldpc codes"
    - "a hybrid arq scheme based on polar codes"
    - "feedback communication systems with limitations on incremental redundancy"
    - "polar coded harq scheme with chase combining"
    - "a rate compatible sphere packing analysis of feedback coding with limited retransmissions"

Connected through hyperedge HE-5 (induced by source paper "variable length convolutional coding for short blocklengths with decision feedback"):
  with members:
    - "convolutional code specific crc code design"
    - "extrinsic jensen shannon divergence applications to variable length coding"
    - "green communication via type i arq finite block length analysis"
    - "finite block length analysis of the incremental redundancy harq"
    - "quasi static simo fading channels at finite blocklength"
    - "a hybrid arq scheme based on polar codes"
    - "feedback communication systems with limitations on incremental redundancy"
    - "reliability based error detection for feedback communication with low latency"

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)