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 implementation of successive cancellation decoders for polar codes"
  Abstract: The recently-discovered polar codes are seen as a major breakthrough in coding theory; they provably achieve the theoretical capacity of discrete memoryless channels using the low complexity successive cancellation (SC) decoding algorithm. Motivated by recent developments in polar coding theory, we propose a family of efficient hardware implementations for SC polar decoders. We show that such decoders can be implemented with O(n) processing elements, O(n) memory elements, and can provide a constant throughput for a given target clock frequency. Furthermore, we show that SC decoding can be implemented in the logarithm domain, thereby eliminating costly multiplication and division operations and reducing the complexity of each processing element greatly. We also present a detailed architecture for an SC decoder and provide logic synthesis results confirming the linear growth in complexity of the decoder as the code length increases.

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

Connected through hyperedge HE-3 (induced by source paper "low latency decoder for short blocklength polar codes"):
  with members:
    - "generalized fast decoding of polar codes"
    - "fast polar decoders algorithm and implementation"
    - "a low complexity improved successive cancellation decoder for polar codes"
    - "parallel decoders of polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-4 (induced by source paper "improved reconciliation with polar codes in quantum key distribution"):
  with members:
    - "fast list decoders for polar codes"
    - "list decoding of polar codes"
    - "efficient reconciliation protocol for discrete variable quantum key distribution"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-5 (induced by source paper "comparison of polar decoders with existing low density parity check and turbo decoders"):
  with members:
    - "fast low complexity decoders for low rate polar codes"
    - "llr based successive cancellation list decoder for polar codes with multibit decision"
    - "partitioned successive cancellation list decoding of polar codes"
    - "multi mode unrolled architectures for polar decoders"
    - "a high throughput list decoder architecture for polar codes"
    - "hardware decoders for polar codes an overview"
    - "fast list decoders for polar codes"
    - "symbol decision successive cancellation list decoder for polar codes"

Connected through hyperedge HE-6 (induced by source paper "binary linear codes with optimal scaling polar codes with large kernels"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "near optimal finite length scaling for polar codes over large alphabets"
    - "construction of polar codes with sublinear complexity"
    - "finite length scaling for polar codes"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "scaling exponent of list decoders with applications to polar codes"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"

Connected through hyperedge HE-7 (induced by source paper "relaxed polar codes"):
  with members:
    - "recursive constructions and their maximum likelihood decoding"
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "binary polar codes are optimised codes for bitwise multistage decoding"
    - "polar codes for broadcast channels"
    - "fast polar decoders algorithm and implementation"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "compound polar codes"
    - "universal polar codes"

Connected through hyperedge HE-8 (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 scalable successive cancellation decoder for polar codes"
    - "a high throughput energy efficient implementation of successive cancellation decoder for polar codes using combinational logic"
    - "how to construct polar codes"
    - "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)