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 low complexity decoders for low rate polar codes"
  Abstract: Polar codes are capacity-achieving error-correcting codes with an explicit construction that can be decoded with low-complexity algorithms. In this work, we show how the state-of-the-art low-complexity decoding algorithm can be improved to better accommodate low-rate codes. More constituent codes are recognized in the updated algorithm and dedicated hardware is added to efficiently decode these new constituent codes. We also alter the polar code construction to further decrease the latency and increase the throughput with little to no noticeable effect on error-correction performance. Rate-flexible decoders for polar codes of length 1024 and 2048 are implemented on FPGA. Over the previous work, they are shown to have from 22 % to 28 % lower latency and 26 % to 34 % greater throughput when decoding low-rate codes. On 65 nm ASIC CMOS technology, the proposed decoder for a (1024, 512) polar code is shown to compare favorably against the state-of-the-art ASIC decoders. With a clock frequency of 400 MHz and a supply voltage of 0.8 V, it has a latency of 0.41 μs and an area efficiency of 1.8 Gbps/mm 2 for an energy efficiency of 77 pJ/info. bit. At 600 MHz with a supply of 1 V, the latency is reduced to 0.27 μs and the area efficiency increased to 2.7 Gbps/mm 2 at 115 pJ/info. bit.

Connected through hyperedge HE-1 (induced by source paper "generalized fast decoding of polar codes"):
  with members:
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "fast list decoders for polar codes"
    - "multi kernel construction of polar codes"
    - "fast polar decoders algorithm and implementation"
    - "a low complexity improved successive cancellation decoder for polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-2 (induced by source paper "comparison of polar decoders with existing low density parity check and turbo decoders"):
  with members:
    - "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"
    - "tc throughput centric successive cancellation decoder hardware implementation for polar codes"

Connected through hyperedge HE-3 (induced by source paper "a constituent codes oriented code construction scheme for polar code aim to reduce the decoding latency"):
  with members:
    - "fast list decoders for polar codes"
    - "237 gbit s unrolled hardware polar decoder"
    - "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-4 (induced by source paper "multi mode unrolled architectures for polar decoders"):
  with members:
    - "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"
    - "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-5 (induced by source paper "unrolled polar decoders part i hardware architectures"):
  with members:
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "237 gbit s unrolled hardware polar decoder"
    - "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.IT(Information Theory)