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: "partitioned list decoding of polar codes analysis and improvement of finite length performance"
  Abstract: Polar codes represent one of the major recent breakthroughs in coding theory and, because of their attractive features, they have been selected for the incoming 5G standard. As such, a lot of attention has been devoted to the development of decoding algorithms with good error performance and efficient hardware implementation. One of the leading candidates in this regard is represented by successive-cancellation list (SCL) decoding. However, its hardware implementation requires a large amount of memory. Recently, a partitioned SCL (PSCL) decoder has been proposed to significantly reduce the memory consumption. In this paper, we examine the paradigm of PSCL decoding from both theoretical and practical standpoints: (i) by changing the construction of the code, we are able to improve the performance at no additional computational, latency or memory cost, (ii) we present an optimal scheme to allocate cyclic redundancy checks (CRCs), and (iii) we provide an upper bound on the list size that allows MAP performance.

Connected through hyperedge HE-1 (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"
    - "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel"
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "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-2 (induced by source paper "design of polar codes in 5g new radio"):
  with members:
    - "on list decoding of 5g nr polar codes"
    - "parity check polar coding for 5g and beyond"
    - "design and implementation of a polar codes blind detection scheme"
    - "circular buffer rate matched polar codes"
    - "improved successive cancellation flip decoding of polar codes based on error distribution"
    - "on the error probability of short concatenated polar and cyclic codes with interleaving"
    - "on puncturing strategies for polar codes"
    - "polar code construction for list decoding"

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"
    - "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-4 (induced by source paper "on the decoding of polar codes on permuted factor graphs"):
  with members:
    - "belief propagation decoding of polar codes on permuted factor graphs"
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "blind detection with polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "list decoding of polar codes"
    - "performance of polar codes for channel and source coding"

Connected through hyperedge HE-5 (induced by source paper "partitioned successive cancellation flip decoding of polar codes"):
  with members:
    - "dynamic scflip decoding of polar codes"
    - "an improved scflip decoder for polar codes"
    - "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-6 (induced by source paper "on error correction performance and implementation of polar code list decoders for 5g"):
  with members:
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "partitioned successive cancellation list decoding of polar codes"
    - "fast list decoders for polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "fast polar decoders algorithm and implementation"
    - "list decoding of 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)