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 adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
  Abstract: In this letter, we propose an adaptive SC (Successive Cancellation)-List decoder for polar codes with CRC. This adaptive SC-List decoder iteratively increases the list size until the decoder outputs contain at least one survival path which can pass CRC. Simulation shows that the adaptive SC-List decoder provides significant complexity reduction. We also demonstrate that polar code (2048, 1024) with 24-bit CRC decoded by our proposed adaptive SC-List decoder with very large list size can achieve a frame error rate FER=0.001 at Eb/No=1.1dB, which is about 0.2dB from the information theoretic limit at this block length.

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 "sphere constraint based enumeration methods to analyze the minimum weight distribution of polar codes"):
  with members:
    - "does gaussian approximation work well for the long length polar code construction"
    - "improved successive cancellation decoding of polar codes"
    - "low complexity sphere decoding of polar codes based on optimum path metric"
    - "list decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-3 (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"
    - "llr based 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 "decoder tailored polar code design using the genetic algorithm"):
  with members:
    - "genetic algorithm based polar code construction for the awgn channel"
    - "design of polar codes in 5g new radio"
    - "belief propagation list decoding of polar codes"
    - "mitigating clipping effects on error floors under belief propagation decoding of polar codes"
    - "polar code construction for list decoding"
    - "comparison of polar decoders with existing low density parity check and turbo decoders"
    - "minimum distance based construction of multi kernel polar codes"
    - "improving belief propagation decoding of polar codes using scattered exit charts"

Connected through hyperedge HE-5 (induced by source paper "deep learning based polar code design"):
  with members:
    - "decoder in the loop genetic optimization based ldpc code design"
    - "decoder tailored polar code design using the genetic algorithm"
    - "design of polar codes in 5g new radio"
    - "belief propagation decoding of polar codes on permuted factor graphs"
    - "end to end learning of communications systems without a channel model"
    - "belief propagation list decoding of polar codes"
    - "an introduction to deep learning for the physical layer"
    - "scaling deep learning based decoding of polar codes via partitioning"

Connected through hyperedge HE-6 (induced by source paper "transmission energy minimization for heterogeneous low latency noma downlink"):
  with members:
    - "joint power and time allocation for noma mec offloading"
    - "efficient error correcting codes in the short blocklength regime"
    - "delay minimization for noma mec offloading"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "joint beamforming and power splitting control in downlink cooperative swipt noma systems"
    - "energy efficient non orthogonal transmission under reliability and finite blocklength constraints"
    - "energy efficient packet scheduling with finite blocklength codes convexity analysis and efficient algorithms"
    - "downlink transmission of short packets framing and control information revisited"

Connected through hyperedge HE-7 (induced by source paper "optimizing polar codes compatible with off the shelf ldpc decoders"):
  with members:
    - "design of polar codes in 5g new radio"
    - "belief propagation list decoding of polar codes"
    - "sparse graphs for belief propagation decoding of polar codes"
    - "code design for short blocks a survey"
    - "fast list decoders for polar codes"
    - "flexible length polar codes through graph based augmentation"
    - "a rm polar codes"
    - "from polar to reed muller codes a technique to improve the finite length performance"

Connected through hyperedge HE-8 (induced by source paper "complexity adjustable sc decoding of polar codes for energy consumption reduction"):
  with members:
    - "relaxed polar codes"
    - "a split reduced successive cancellation list decoder for polar codes"
    - "fast list decoders for polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "reduce the complexity of list decoding of polar codes by tree pruning"
    - "fast polar decoders algorithm and implementation"
    - "increasing the speed of polar list decoders"
    - "improved successive cancellation 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)