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: "parallel decoders of polar codes"
  Abstract: In this letter, we propose parallel SC (Successive Cancellation) decoder and parallel SC-List decoder for polar codes. The parallel decoder is composed of M=2^m(m>=1) component decoders working in parallel and each component decoder decodes a Polar code of a block size of 1/M of the original Polar code. Therefore the parallel decoder has M times faster decoding speed. Our simulation results show that the parallel decoder has almost the same error-rate performance as the conventional non-parallel decoder.

Connected through hyperedge HE-1 (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"
    - "list decoding of polar codes"
    - "hardware implementation of successive cancellation decoders for polar codes"

Connected through hyperedge HE-2 (induced by source paper "scaling deep learning based decoding of polar codes via partitioning"):
  with members:
    - "partitioned successive cancellation list decoding of polar codes"
    - "learning to decode linear codes using deep learning"
    - "hardware decoders for polar codes an overview"
    - "combining belief propagation and successive cancellation list decoding of polar codes on a gpu platform"
    - "code design for short blocks a survey"
    - "fast list decoders for polar codes"
    - "theano a python framework for fast computation of mathematical expressions"
    - "tensorflow large scale machine learning on heterogeneous distributed systems"

Connected through hyperedge HE-3 (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"
    - "a reduced latency list decoding algorithm for polar codes"
    - "successive cancellation list polar decoder using log likelihood ratios"
    - "an efficient list decoder architecture for polar codes"

Connected through hyperedge HE-4 (induced by source paper "symbol decision successive cancellation list decoder for polar codes"):
  with members:
    - "llr based successive cancellation list decoding of polar codes"
    - "error performance analysis of the symbol decision sc polar decoder"
    - "symbol based successive cancellation list decoder for polar codes"
    - "a scalable successive cancellation decoder for polar codes"
    - "an efficient list decoder architecture for polar codes"
    - "low complexity sphere decoding of polar codes based on optimum path metric"
    - "list decoding of polar codes"
    - "polar codes for q ary channels q 2 r"

Connected through hyperedge HE-5 (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 reduced latency list decoding algorithm for polar codes"
    - "a scalable successive cancellation decoder for polar codes"

Connected through hyperedge HE-6 (induced by source paper "error performance analysis of the symbol decision sc polar decoder"):
  with members:
    - "symbol decision successive cancellation list decoder for polar codes"
    - "symbol based successive cancellation list decoder for polar codes"
    - "low complexity sphere decoding of polar codes based on optimum path metric"
    - "list decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polarization for arbitrary discrete memoryless channels"

Connected through hyperedge HE-7 (induced by source paper "symbol based successive cancellation list decoder for polar codes"):
  with members:
    - "fast polar decoders algorithm and implementation"
    - "an efficient list decoder architecture for polar codes"
    - "list decoding of polar codes"
    - "a practical approach to polar codes"
    - "hardware architectures for successive cancellation decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polarization for arbitrary discrete memoryless channels"

Connected through hyperedge HE-8 (induced by source paper "low latency successive cancellation list decoders for polar codes with multi bit decision"):
  with members:
    - "llr based successive cancellation list decoding of polar codes"
    - "fast polar decoders algorithm and implementation"
    - "a scalable successive cancellation decoder for polar codes"
    - "hardware architecture for list sc decoding of polar codes"
    - "list decoding of 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.IT(Information Theory)