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: "hardware architectures for successive cancellation decoding of polar codes"
  Abstract: The recently-discovered polar codes are widely seen as a major breakthrough in coding theory. These codes achieve the capacity of many important channels under successive cancellation decoding. Motivated by the rapid progress in the theory of polar codes, we propose a family of architectures for efficient hardware implementation of successive cancellation decoders. We show that such decoders can be implemented with O(n) processing elements and O(n) memory elements, while providing constant throughput. We also propose a technique for overlapping the decoding of several consecutive codewords, thereby achieving a significant speed-up factor. We furthermore show that successive cancellation decoding can be implemented in the logarithmic domain, thereby eliminating the multiplication and division operations and greatly reducing the complexity of each processing element.

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 "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"
    - "llr based successive cancellation list decoding of polar codes"
    - "on the construction of polar codes"
    - "polar codes robustness of the successive cancellation decoder with respect to quantization"
    - "how to construct polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"
    - "on the rate of channel polarization"

Connected through hyperedge HE-3 (induced by source paper "permutation decoding of polar codes"):
  with members:
    - "a new permutation decoding method for reed muller codes"
    - "on the decoding of polar codes on permuted factor graphs"
    - "decoding reed muller and polar codes by successive factor graph permutations"
    - "dynamic scflip decoding of polar codes"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "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 "ternary quantized polar code decoders analysis and design"):
  with members:
    - "quantized polar code decoders analysis and design"
    - "polarbear a 28 nm fd soi asic for decoding of polar codes"
    - "hardware decoders for polar codes an overview"
    - "llr based successive cancellation list decoding of polar codes"
    - "list decoding of polar codes"
    - "polar codes robustness of the successive cancellation decoder with respect to quantization"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"

Connected through hyperedge HE-5 (induced by source paper "towards practical software stack decoding of polar codes"):
  with members:
    - "fast sequential decoding of polar codes"
    - "fast list decoders for polar codes"
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "fast polar decoders algorithm and implementation"
    - "improved successive cancellation decoding of polar codes"
    - "partial sums computation in polar codes decoding"
    - "list decoding of polar codes"

Connected through hyperedge HE-6 (induced by source paper "faulty successive cancellation decoding of polar codes for the binary erasure channel"):
  with members:
    - "analysis and design of finite alphabet iterative decoders robust to faulty hardware"
    - "density evolution and functional threshold for the noisy min sum decoder"
    - "density evolution for min sum decoding of ldpc codes under unreliable message storage"
    - "on the correlation between polarized becs"
    - "polar codes robustness of the successive cancellation decoder with respect to quantization"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "performance of ldpc codes under faulty iterative decoding"

Connected through hyperedge HE-7 (induced by source paper "memory management in successive cancellation based decoders for multi kernel polar codes"):
  with members:
    - "a multi kernel multi code polar decoder architecture"
    - "low complexity puncturing and shortening of polar codes"
    - "minimum distance based construction of multi kernel polar codes"
    - "code design for short blocks a survey"
    - "multi kernel construction of polar codes"
    - "binary polarization kernels from code decompositions"

Connected through hyperedge HE-8 (induced by source paper "fast low complexity decoders for low rate polar codes"):
  with members:
    - "fast polar decoders algorithm and implementation"
    - "enabling complexity performance trade offs for successive cancellation decoding of polar codes"
    - "a high throughput energy efficient implementation of successive cancellation decoder for polar codes using combinational logic"
    - "how to construct polar codes"
    - "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"

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.AR(Hardware Architecture)