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: "an improved scflip decoder for polar codes"
  Abstract: This paper focuses on the recently introduced Successive Cancellation Flip (SCFlip) decoder of polar codes. Our contribution is twofold. First, we propose the use of an optimized metric to determine the flipping positions within the SCFlip decoder, which improves its ability to find the first error that occurred during the initial SC decoding attempt. We also show that the proposed metric allows closely approaching the performance of an ideal SCFlip decoder. Second, we introduce a generalisation of the SCFlip decoder to a number of $\omega$ nested flips, denoted by SCFlip-$\omega$, using a similar optimized metric to determine the positions of the nested flips. We show that the SCFlip-2 decoder yields significant gains in terms of decoding performance and competes with the performance of the CRC-aided SC-List decoder with list size L=4, while having an average decoding complexity similar to that of the standard SC decoding, at medium to high signal to noise ratio.

Connected through hyperedge HE-1 (induced by source paper "shifted pruning for list decoding of polar codes"):
  with members:
    - "progressive bit flipping decoding of polar codes over layered critical sets"
    - "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 "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"
    - "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"
    - "progressive bit flipping decoding of polar codes over layered critical sets"

Connected through hyperedge HE-3 (induced by source paper "partitioned successive cancellation flip decoding of polar codes"):
  with members:
    - "dynamic scflip decoding of polar codes"
    - "partitioned list decoding of polar codes analysis and improvement of finite length performance"
    - "on error correction performance and implementation of polar code list decoders for 5g"
    - "partitioned successive cancellation list decoding of polar codes"
    - "a low complexity improved successive cancellation decoder for polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-4 (induced by source paper "improved successive cancellation flip decoding of polar codes based on error distribution"):
  with members:
    - "dynamic scflip decoding of polar codes"
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "a low complexity improved successive cancellation decoder for polar codes"
    - "a scalable successive cancellation decoder for polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-5 (induced by source paper "dynamic scflip decoding of polar codes"):
  with members:
    - "llr based successive cancellation list decoding of polar codes"
    - "low latency list decoding of polar codes with double thresholding"
    - "a low complexity improved successive cancellation decoder for polar codes"
    - "scaling exponent of list decoders with applications to polar codes"
    - "list decoding of polar codes"
    - "polar codes with mixed kernels"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-6 (induced by source paper "progressive bit flipping decoding of polar codes over layered critical sets"):
  with members:
    - "a low complexity improved successive cancellation decoder for polar codes"
    - "improved successive cancellation decoding of polar codes"
    - "scaling exponent of list decoders with applications to polar codes"
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"

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)