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: "fast and flexible successive cancellation list decoders for polar codes"
  Abstract: Polar codes have gained significant amount of attention during the past few years and have been selected as a coding scheme for the next generation of mobile broadband standard. Among decoding schemes, successive-cancellation list (SCL) decoding provides a reasonable tradeoff between the error-correction performance and hardware implementation complexity when used to decode polar codes, at the cost of limited throughput. The simplified SCL (SSCL) and its extension SSCL-SPC increase the speed of decoding by removing redundant calculations when encountering particular information and frozen bit patterns (rate one and single parity check codes), while keeping the error-correction performance unaltered. In this paper, we improve SSCL and SSCL-SPC by proving that the list size imposes a specific number of path splitting required to decode rate one and single parity check codes. Thus, the number of splitting can be limited while guaranteeing exactly the same error-correction performance as if the paths were forked at each bit estimation. We call the new decoding algorithms Fast-SSCL and Fast-SSCL-SPC. Moreover, we show that the number of path forks in a practical application can be tuned to achieve desirable speed, while keeping the error-correction performance almost unchanged. Hardware architectures implementing both algorithms are then described and implemented: It is shown that our design can achieve   $\mathbf {1.86}$    Gb/s throughput, higher than the best state-of-the-art decoders.

Connected through hyperedge HE-1 (induced by source paper "polar codes and their quantum domain counterparts"):
  with members:
    - "reinforcement learning for nested polar code construction"
    - "decoder tailored polar code design using the genetic algorithm"
    - "genetic algorithm based polar code construction for the awgn channel"
    - "improved bit flipping algorithm for successive cancellation decoding of polar codes"
    - "design of polar codes in 5g new radio"
    - "belief propagation decoding of polar codes on permuted factor graphs"
    - "improved successive cancellation flip decoding of polar codes based on error distribution"
    - "belief propagation list decoding of polar codes"

Connected through hyperedge HE-2 (induced by source paper "sublinear latency for simplified successive cancellation decoding of polar codes"):
  with members:
    - "log logarithmic time pruned polar coding"
    - "polar codes with exponentially small error at finite block length"
    - "polar code moderate deviation recovering the scaling exponent"
    - "partitioned list decoding of polar codes analysis and improvement of finite length performance"
    - "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel"
    - "binary linear codes with optimal scaling polar codes with large kernels"
    - "partitioned successive cancellation list decoding of polar codes"
    - "construction of polar codes with sublinear complexity"

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"
    - "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"
    - "a comparative study of polar code constructions for the awgn channel"

Connected through hyperedge HE-4 (induced by source paper "an asymmetric adaptive scl decoder hardware for ultra low error rate polar codes"):
  with members:
    - "parity check polar coding for 5g and beyond"
    - "a 5 16gbps decoder asic for polar code in 16nm finfet"
    - "a high throughput list decoder architecture for polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "a decision aided parallel sc list decoder for polar codes"
    - "an efficient list decoder architecture for polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"

Connected through hyperedge HE-5 (induced by source paper "practical product code construction of polar codes"):
  with members:
    - "construction and decoding of product codes with non systematic polar codes"
    - "generalized fast decoding of polar codes"
    - "a comparative study of polar code constructions for the awgn channel"
    - "fast polar decoders algorithm and implementation"
    - "irregular product codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-6 (induced by source paper "enumeration of minimum hamming weight polar codewords with sublinear complexity"):
  with members:
    - "fast simplified successive cancellation list decoding of polar codes"
    - "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"
    - "on finite length performance of polar codes stopping sets error floor and concatenated design"
    - "new techniques for upper bounding the ml decoding performance of binary linear codes"

Connected through hyperedge HE-7 (induced by source paper "construction and decoding of product codes with non systematic polar codes"):
  with members:
    - "a comparative study of polar code constructions for the awgn channel"
    - "list decoding of polar codes"

Connected through hyperedge HE-8 (induced by source paper "improved bit flipping algorithm for successive cancellation decoding of polar codes"):
  with members:
    - "partitioned successive cancellation flip decoding of polar codes"
    - "improved successive cancellation flip decoding of polar codes based on error distribution"
    - "dynamic scflip decoding of polar codes"
    - "an improved scflip decoder for polar codes"
    - "partitioned list decoding of polar codes analysis and improvement of finite length performance"
    - "polarbear a 28 nm fd soi asic for decoding of polar codes"
    - "on error correction performance and implementation of polar code list decoders for 5g"
    - "progressive bit flipping decoding of polar codes over layered critical sets"

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)