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: "progressive bit flipping decoding of polar codes over layered critical sets"
  Abstract: In successive cancellation (SC) polar decoding, an incorrect estimate of any prior unfrozen bit may bring about severe error propagation in the following decoding, thus it is desirable to find out and correct an error as early as possible. In this paper, we first construct a critical set $S$ of unfrozen bits, which with high probability (typically $>99\%$) includes the bit where the first error happens. Then we develop a progressive multi-level bit-flipping decoding algorithm to correct multiple errors over the multiple-layer critical sets each of which is constructed using the remaining undecoded subtree associated with the previous layer. The \emph{level} in fact indicates the number of \emph{independent} errors that could be corrected. We show that as the level increases, the block error rate (BLER) performance of the proposed progressive bit flipping decoder competes with the corresponding cyclic redundancy check (CRC) aided successive cancellation list (CA-SCL) decoder, e.g., a level 4 progressive bit-flipping decoder is comparable to the CA-SCL decoder with a list size of $L=32$. Furthermore, the average complexity of the proposed algorithm is much lower than that of a SCL decoder (and is similar to that of SC decoding) at medium to high signal to noise ratio (SNR).

Connected through hyperedge HE-1 (induced by source paper "shifted pruning for list decoding of polar codes"):
  with members:
    - "an improved scflip decoder for polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "a low complexity improved successive cancellation decoder for polar codes"
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"

Connected through hyperedge HE-2 (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"
    - "deep residual learning for image recognition"
    - "a low complexity improved successive cancellation decoder for polar codes"
    - "sequence to sequence learning with neural networks"
    - "improved successive cancellation decoding of polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-3 (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"
    - "fast and flexible successive cancellation list 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)