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: "a low complexity improved successive cancellation decoder for polar codes"
  Abstract: Under successive cancellation (SC) decoding, polar codes are inferior to other codes of similar blocklength in terms of frame error rate. While more sophisticated decoding algorithms such as list- or stack-decoding partially mitigate this performance loss, they suffer from an increase in complexity. In this paper, we describe a new flavor of the SC decoder, called the SC flip decoder. Our algorithm preserves the low memory requirements of the basic SC decoder and adjusts the required decoding effort to the signal quality. In the waterfall region, its average computational complexity is almost as low as that of the SC decoder.

Connected through hyperedge HE-1 (induced by source paper "polarization adjusted convolutional pac codes fano decoding vs list decoding"):
  with members:
    - "on pre transformed polar codes"
    - "from sequential decoding to channel polarization and back again"
    - "parity check polar coding for 5g and beyond"
    - "a randomized construction of polar subcodes"
    - "llr based successive cancellation list decoding of polar codes"
    - "on the origin of polar coding"
    - "a rm polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-2 (induced by source paper "shifted pruning for list decoding of polar codes"):
  with members:
    - "an improved scflip decoder for polar codes"
    - "progressive bit flipping decoding of polar codes over layered critical sets"
    - "llr based successive cancellation list decoding of polar codes"
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"

Connected through hyperedge HE-3 (induced by source paper "rate flexible fast polar decoders"):
  with members:
    - "efficient bit channel reliability computation for multi mode polar code encoders and decoders"
    - "llr based successive cancellation list decoder for polar codes with multibit decision"
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "beta expansion a theoretical framework for fast and recursive construction of polar codes"
    - "a high throughput list decoder architecture for polar codes"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "construction of polar codes with sublinear complexity"
    - "symbol decision successive cancellation list decoder for polar codes"

Connected through hyperedge HE-4 (induced by source paper "deep learning aided successive cancellation decoding of polar codes"):
  with members:
    - "neural dynamic successive cancellation flip decoding of polar codes"
    - "improved bit flipping algorithm for successive cancellation decoding of polar codes"
    - "neural belief propagation decoding of crc polar concatenated codes"
    - "partitioned successive cancellation flip decoding of polar codes"
    - "deep learning methods for improved decoding of linear codes"
    - "improved successive cancellation flip decoding of polar codes based on error distribution"
    - "dynamic scflip decoding of polar codes"
    - "scaling deep learning based decoding of polar codes via partitioning"

Connected through hyperedge HE-5 (induced by source paper "neural dynamic successive cancellation flip decoding of polar codes"):
  with members:
    - "improved bit flipping algorithm for successive cancellation decoding of polar codes"
    - "neural belief propagation decoding of crc polar concatenated codes"
    - "partitioned successive cancellation flip decoding of polar codes"
    - "deep learning methods for improved decoding of linear codes"
    - "improved successive cancellation flip decoding of polar codes based on error distribution"
    - "dynamic scflip decoding of polar codes"
    - "neural offset min sum decoding"
    - "tensorflow a system for large scale machine learning"

Connected through hyperedge HE-6 (induced by source paper "permutation decoding of polar codes"):
  with members:
    - "a new permutation decoding method for reed muller codes"
    - "on the decoding of polar codes on permuted factor graphs"
    - "decoding reed muller and polar codes by successive factor graph permutations"
    - "dynamic scflip decoding of polar codes"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "llr based successive cancellation list decoding of polar codes"
    - "list decoding of polar codes"
    - "hardware architectures for successive cancellation decoding of polar codes"

Connected through hyperedge HE-7 (induced by source paper "learning to flip successive cancellation decoding of polar codes with lstm networks"):
  with members:
    - "improved successive cancellation flip decoding of polar codes based on error distribution"
    - "dynamic scflip decoding of polar codes"
    - "scaling deep learning based decoding of polar codes via partitioning"
    - "progressive bit flipping decoding of polar codes over layered critical sets"
    - "deep residual learning for image recognition"
    - "sequence to sequence learning with neural networks"
    - "improved successive cancellation decoding of polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-8 (induced by source paper "low latency decoder for short blocklength polar codes"):
  with members:
    - "generalized fast decoding of polar codes"
    - "fast polar decoders algorithm and implementation"
    - "parallel decoders of polar codes"
    - "list decoding of polar codes"
    - "hardware implementation of successive cancellation decoders for polar codes"

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)