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: "a scalable successive cancellation decoder for polar codes"
  Abstract: Polar codes are the first error-correcting codes to provably achieve channel capacity, asymptotically in code length, with an explicit construction. However, under successive-cancellation decoding, polar codes require very long code lengths to compete with existing modern codes. Nonetheless, the successive cancellation algorithm enables very-low-complexity implementations in hardware, due to the regular structure exhibited by polar codes. In this paper, we present an improved architecture for successive-cancellation decoding of polar codes, making use of a novel semi-parallel, encoder-based partial-sum computation module. We also provide quantization results for realistic code length N=2#N# 15#N#, and explore various optimization techniques such as a chained processing element and a variable quantization scheme. This design is shown to scale to code lengths of up to N=2#N# 21#N#, enabled by its low logic use, low register use and simple datapaths, limited almost exclusively by the amount of available SRAM. It also supports an overlapped loading of frames, allowing full-throughput decoding with a single set of input buffers.

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 "improved successive cancellation flip decoding of polar codes based on error distribution"):
  with members:
    - "dynamic scflip decoding of polar codes"
    - "an improved scflip decoder for 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"
    - "list decoding of polar codes"

Connected through hyperedge HE-3 (induced by source paper "channel capacity of polar coding with a given polar mismatched successive cancellation decoder"):
  with members:
    - "a simple proof of fast polarization"
    - "on the scaling exponent of polar codes for binary input energy harvesting channels"
    - "a split reduced successive cancellation list decoder for polar codes"
    - "a low latency list successive cancellation decoding implementation for polar codes"
    - "a high throughput list decoder architecture for polar codes"
    - "fast list decoders for polar codes"
    - "symbol decision successive cancellation list decoder for polar codes"
    - "polar coding for processes with memory"

Connected through hyperedge HE-4 (induced by source paper "a low latency list successive cancellation decoding implementation for polar codes"):
  with members:
    - "symbol decision successive cancellation list decoder for polar codes"
    - "on metric sorting for successive cancellation list decoding of polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "low latency list decoding of polar codes with double thresholding"
    - "symbol based successive cancellation list decoder for polar codes"
    - "fast polar decoders algorithm and implementation"
    - "finite length scaling for polar codes"
    - "increasing the speed of polar list decoders"

Connected through hyperedge HE-5 (induced by source paper "symbol decision successive cancellation list decoder for polar codes"):
  with members:
    - "llr based successive cancellation list decoding of polar codes"
    - "error performance analysis of the symbol decision sc polar decoder"
    - "symbol based successive cancellation list decoder for polar codes"
    - "an efficient list decoder architecture for polar codes"
    - "low complexity sphere decoding of polar codes based on optimum path metric"
    - "parallel decoders of polar codes"
    - "list decoding of polar codes"
    - "polar codes for q ary channels q 2 r"

Connected through hyperedge HE-6 (induced by source paper "multi mode unrolled architectures for polar decoders"):
  with members:
    - "fast low complexity decoders for low rate polar codes"
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "237 gbit s unrolled hardware polar decoder"
    - "fast polar decoders algorithm and implementation"
    - "a high throughput energy efficient implementation of successive cancellation decoder for polar codes using combinational logic"
    - "hardware implementation of successive cancellation decoders for polar codes"
    - "how to construct polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-7 (induced by source paper "a multi mode area efficient scl polar decoder"):
  with members:
    - "a high throughput list decoder architecture for polar codes"
    - "symbol decision successive cancellation list decoder for polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "symbol based successive cancellation list decoder for polar codes"
    - "fast polar decoders algorithm and implementation"
    - "increasing the speed of polar list decoders"
    - "a reduced latency list decoding algorithm for polar codes"
    - "an efficient list decoder architecture for polar codes"

Connected through hyperedge HE-8 (induced by source paper "low latency list decoding of polar codes with double thresholding"):
  with members:
    - "llr based successive cancellation list decoding of polar codes"
    - "fast polar decoders algorithm and implementation"
    - "increasing the speed of polar list decoders"
    - "a reduced latency list decoding algorithm for polar codes"
    - "successive cancellation list polar decoder using log likelihood ratios"
    - "an efficient list decoder architecture for polar codes"
    - "improved successive cancellation decoding of polar codes"
    - "low complexity sphere decoding of polar codes based on optimum path metric"

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)