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: "fast polar decoders algorithm and implementation"
  Abstract: Polar codes provably achieve the symmetric capacity of a memoryless channel while having an explicit construction. The adoption of polar codes however, has been hampered by the low throughput of their decoding algorithm. This work aims to increase the throughput of polar decoding hardware by an order of magnitude relative to successive-cancellation decoders and is more than 8 times faster than the current fastest polar decoder. We present an algorithm, architecture, and FPGA implementation of a flexible, gigabit-per-second polar decoder.

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 "sublinear latency for simplified successive cancellation decoding of polar codes"):
  with members:
    - "log logarithmic time pruned polar coding"
    - "polar codes with exponentially small error at finite block length"
    - "polar code moderate deviation recovering the scaling exponent"
    - "partitioned list decoding of polar codes analysis and improvement of finite length performance"
    - "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel"
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "binary linear codes with optimal scaling polar codes with large kernels"
    - "partitioned successive cancellation list decoding of polar codes"

Connected through hyperedge HE-3 (induced by source paper "log logarithmic time pruned polar coding"):
  with members:
    - "polar like codes and asymptotic tradeoff among block length code rate and error probability"
    - "polar codes with exponentially small error at finite block length"
    - "general strong polarization"
    - "polar code moderate deviation recovering the scaling exponent"
    - "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel"
    - "relaxed polar codes"
    - "flexible length polar codes through graph based augmentation"
    - "a packing lemma for polar codes"

Connected through hyperedge HE-4 (induced by source paper "rate flexible fast polar decoders"):
  with members:
    - "efficient bit channel reliability computation for multi mode polar code encoders and decoders"
    - "llr based successive cancellation list decoder for polar codes with multibit decision"
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "beta expansion a theoretical framework for fast and recursive construction of polar codes"
    - "a high throughput list decoder architecture for polar codes"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "construction of polar codes with sublinear complexity"
    - "symbol decision successive cancellation list decoder for polar codes"

Connected through hyperedge HE-5 (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"
    - "increasing the speed of polar list decoders"
    - "improved successive cancellation decoding of polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-6 (induced by source paper "asymmetric construction of low latency and length flexible polar codes"):
  with members:
    - "a multi kernel multi code polar decoder architecture"
    - "low complexity puncturing and shortening of polar codes"
    - "multi kernel polar codes proof of polarization and error exponents"
    - "fast list decoders for polar codes"
    - "multi kernel construction of polar codes"
    - "list decoding of 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 "practical product code construction of polar codes"):
  with members:
    - "construction and decoding of product codes with non systematic polar codes"
    - "generalized fast decoding of polar codes"
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "a comparative study of polar code constructions for the awgn channel"
    - "irregular product codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-8 (induced by source paper "low latency decoder for short blocklength polar codes"):
  with members:
    - "generalized fast decoding of polar codes"
    - "a low complexity improved successive cancellation decoder for polar codes"
    - "parallel decoders of polar codes"
    - "list decoding of polar codes"
    - "hardware implementation of successive cancellation decoders for 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.AR(Hardware Architecture)