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: "llr based successive cancellation list decoding of polar codes"
  Abstract: We show that successive cancellation list decoding can be formulated exclusively using log-likelihood ratios. In addition to numerical stability, the log-likelihood ratio based formulation has useful properties that simplify the sorting step involved in successive cancellation list decoding. We propose a hardware architecture of the successive cancellation list decoder in the log-likelihood ratio domain which, compared with a log-likelihood domain implementation, requires less irregular and smaller memories. This simplification, together with the gains in the metric sorter, lead to    $ 56\%$   to   $137\%$   higher throughput per unit area than other recently proposed architectures. We then evaluate the empirical performance of the CRC-aided successive cancellation list decoder at different list sizes using different CRCs and conclude that it is important to adapt the CRC length to the list size in order to achieve the best error-rate performance of concatenated polar codes. Finally, we synthesize conventional successive cancellation decoders at large block-lengths with the same block-error probability as our proposed CRC-aided successive cancellation list decoders to demonstrate that, while our decoders have slightly lower throughput and larger area, they have a significantly smaller decoding latency.

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 "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"
    - "on the origin of polar coding"
    - "a rm polar codes"
    - "a low complexity improved successive cancellation decoder for polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-3 (induced by source paper "finite level quantization procedures for construction and decoding of polar codes"):
  with members:
    - "quantized polar code decoders analysis and design"
    - "efficient polar code construction for higher order modulation"
    - "on the construction of polar codes"
    - "polar codes robustness of the successive cancellation decoder with respect to quantization"
    - "how to construct polar codes"
    - "hardware architectures for successive cancellation decoding of polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"
    - "on the rate of channel polarization"

Connected through hyperedge HE-4 (induced by source paper "ordered reliability bits guessing random additive noise decoding"):
  with members:
    - "guessing random additive noise decoding with symbol reliability information srgrand"
    - "capacity achieving guessing random additive noise decoding"
    - "guessing random additive noise decoding with soft detection symbol reliability information sgrand"
    - "fast and flexible software polar list decoders"
    - "list decoding of polar codes"

Connected through hyperedge HE-5 (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"
    - "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-6 (induced by source paper "polar slotted aloha over slot erasure channels"):
  with members:
    - "faulty successive cancellation decoding of polar codes for the binary erasure channel"
    - "error floor analysis of coded slotted aloha over packet erasure channels"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "coded random access applying codes on graphs to design random access protocols"
    - "list decoding of polar codes"

Connected through hyperedge HE-7 (induced by source paper "soft maximum likelihood decoding using grand"):
  with members:
    - "capacity achieving guessing random additive noise decoding"
    - "design of polar codes in 5g new radio"
    - "fast list decoders for polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-8 (induced by source paper "recursive projection aggregation decoding of reed muller codes"):
  with members:
    - "reed muller codes theory and algorithms"
    - "reed muller codes polarize"
    - "on the performance of reed muller codes with respect to random errors and erasures"
    - "decoding reed muller codes using minimum weight parity checks"
    - "decoding reed muller and polar codes by successive factor graph permutations"
    - "almost optimal scaling of reed muller codes on bec and bsc channels"
    - "soft decision decoding of reed muller codes recursive lists"
    - "recursive decoding and its performance for low rate reed muller 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)