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: "237 gbit s unrolled hardware polar decoder"
  Abstract: A new architecture for a polar decoder using a reduced complexity successive-cancellation (SC) decoding algorithm is presented. This novel fully unrolled, deeply pipelined architecture is capable of achieving a coded throughput of over 237 Gbit/s for a (1024, 512) polar code implemented using a field-programmable gate array. This decoder is two orders of magnitude faster than state-of-the-art polar decoders.

Connected through hyperedge HE-1 (induced by source paper "a multi gbps unrolled hardware list decoder for a systematic polar code"):
  with members:
    - "multi mode unrolled architectures for polar decoders"
    - "a high throughput list decoder architecture for polar codes"
    - "fast list decoders for polar codes"
    - "symbol decision successive cancellation list decoder for polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "a fully unrolled ldpc decoder based on quantized message passing"
    - "fast polar decoders algorithm and implementation"
    - "list decoding of polar codes"

Connected through hyperedge HE-2 (induced by source paper "efficient bit channel reliability computation for multi mode polar code encoders and decoders"):
  with members:
    - "fast simplified successive cancellation list decoding of polar codes"
    - "multi mode unrolled architectures for polar decoders"
    - "symbol decision successive cancellation list decoder for polar codes"
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "fast polar decoders algorithm and implementation"
    - "list decoding of 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-3 (induced by source paper "fast encoding and decoding of flexible rate and flexible length polar codes"):
  with members:
    - "llr based successive cancellation list decoder for polar codes with multibit decision"
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "a comparative study of polar code constructions for the awgn channel"
    - "fast polar decoders algorithm and implementation"
    - "performance of polar codes for channel and source coding"

Connected through hyperedge HE-4 (induced by source paper "hardware decoders for polar codes an overview"):
  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"
    - "unrolled polar decoders part i hardware architectures"
    - "low latency list decoding of polar codes with double thresholding"
    - "low complexity belief propagation polar code decoders"
    - "fast polar decoders algorithm and implementation"
    - "a reduced latency list decoding algorithm for polar codes"

Connected through hyperedge HE-5 (induced by source paper "a constituent codes oriented code construction scheme for polar code aim to reduce the decoding latency"):
  with members:
    - "fast low complexity decoders for low rate polar codes"
    - "fast list decoders for polar codes"
    - "a comparative study of polar code constructions for the awgn channel"
    - "overlapped list successive cancellation approach for hardware efficient polar code decoder"
    - "tc throughput centric successive cancellation decoder hardware implementation for polar codes"
    - "xj bp express journey belief propagation decoding for polar codes"
    - "fast polar decoders algorithm and implementation"
    - "list decoding of polar codes"

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"
    - "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"
    - "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 "unrolled polar decoders part i hardware architectures"):
  with members:
    - "fast low complexity decoders for low rate polar codes"
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "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"
    - "hardware implementation of successive cancellation decoders for polar codes"
    - "how to construct 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)