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: "a reduced latency list decoding algorithm for polar codes"
  Abstract: Long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm. But for polar codes with short and moderate code length, the decoding performance of the SC decoding algorithm is inferior. The cyclic redundancy check (CRC) aided successive cancelation list (SCL) decoding algorithm has better error performance than the SC decoding algorithm for short or moderate polar codes. However, the CRC aided SCL (CA-SCL) decoding algorithm still suffer from long decoding latency. In this paper, a reduced latency list decoding (RLLD) algorithm for polar codes is proposed. For the proposed RLLD algorithm, all rate-0 nodes and part of rate-1 nodes are decoded instantly without traversing the corresponding subtree. A list maximum-likelihood decoding (LMLD) algorithm is proposed to decode the maximum likelihood (ML) nodes and the remaining rate-1 nodes. Moreover, a simplified LMLD (SLMLD) algorithm is also proposed to reduce the computational complexity of the LMLD algorithm. Suppose a partial parallel list decoder architecture with list size $L=4$ is used, for an (8192, 4096) polar code, the proposed RLLD algorithm can reduce the number of decoding clock cycles and decoding latency by 6.97 and 6.77 times, respectively.

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 "fast and flexible software polar list decoders"):
  with members:
    - "low latency software polar decoders"
    - "fast list decoders for polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "fast polar decoders algorithm and implementation"
    - "increasing the speed of polar list decoders"
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
    - "how to construct polar codes"

Connected through hyperedge HE-3 (induced by source paper "a low latency list successive cancellation decoding implementation for polar codes"):
  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"
    - "low latency list decoding of polar codes with double thresholding"
    - "symbol based successive cancellation list decoder for polar codes"
    - "fast polar decoders algorithm and implementation"
    - "finite length scaling for polar codes"
    - "increasing the speed of polar list decoders"

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"
    - "237 gbit s unrolled hardware polar decoder"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "a high throughput list decoder architecture for polar codes"):
  with members:
    - "symbol decision successive cancellation list decoder for polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "a hybrid partial sum computation unit architecture for list decoders of polar codes"
    - "fast polar decoders algorithm and implementation"
    - "increasing the speed of polar list decoders"
    - "successive cancellation list polar decoder using log likelihood ratios"
    - "an efficient list decoder architecture for polar codes"
    - "parallel decoders of polar codes"

Connected through hyperedge HE-6 (induced by source paper "a multi mode area efficient scl polar decoder"):
  with members:
    - "a high throughput list decoder architecture for polar codes"
    - "symbol decision successive cancellation list decoder for polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "symbol based successive cancellation list decoder for polar codes"
    - "fast polar decoders algorithm and implementation"
    - "increasing the speed of polar list decoders"
    - "a scalable successive cancellation decoder for polar codes"
    - "an efficient list decoder architecture for polar codes"

Connected through hyperedge HE-7 (induced by source paper "low latency list decoding of polar codes with double thresholding"):
  with members:
    - "llr based successive cancellation list decoding of polar codes"
    - "fast polar decoders algorithm and implementation"
    - "increasing the speed of polar list decoders"
    - "successive cancellation list polar decoder using log likelihood ratios"
    - "a scalable successive cancellation decoder for polar codes"
    - "an efficient list decoder architecture for polar codes"
    - "improved successive cancellation decoding of polar codes"
    - "low complexity sphere decoding of polar codes based on optimum path metric"

Connected through hyperedge HE-8 (induced by source paper "llr based successive cancellation list decoding of polar codes"):
  with members:
    - "fast polar decoders algorithm and implementation"
    - "increasing the speed of polar list decoders"
    - "an efficient list decoder architecture for polar codes"
    - "improved successive cancellation decoding of polar codes"
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
    - "reduced latency sc polar decoder architectures"
    - "hardware architectures for successive cancellation decoding of 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)