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: "increasing the speed of polar list decoders"
  Abstract: In this work, we present a simplified successive cancellation list decoder that uses a Chase-like decoding process to achieve a six time improvement in speed compared to successive cancellation list decoding while maintaining the same error-correction performance advantage over standard successive-cancellation polar decoders. We discuss the algorithm and detail the data structures and methods used to obtain this speed-up. We also propose an adaptive decoding algorithm that significantly improves the throughput while retaining the error-correction performance. Simulation results over the additive white Gaussian noise channel are provided and show that the proposed system is up to 16 times faster than an LDPC decoder of the same frame size, code rate, and similar error-correction performance, making it more suitable for use as a software decoding solution.

Connected through hyperedge HE-1 (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"
    - "fast polar decoders algorithm and implementation"
    - "improved successive cancellation decoding of polar codes"
    - "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"
    - "a reduced latency list decoding algorithm for polar codes"
    - "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"
    - "a reduced latency list decoding algorithm for polar codes"

Connected through hyperedge HE-4 (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"
    - "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"
    - "parallel decoders of polar codes"

Connected through hyperedge HE-5 (induced by source paper "fast list decoders for polar codes"):
  with members:
    - "low latency software polar decoders"
    - "soft decision decoding of reed muller codes recursive lists"
    - "symbol decision successive cancellation list decoder for polar codes"
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "low latency list decoding of polar codes with double thresholding"
    - "fast polar decoders algorithm and implementation"
    - "an efficient list decoder architecture for polar codes"

Connected through hyperedge HE-6 (induced by source paper "improving belief propagation decoding of polar codes using scattered exit charts"):
  with members:
    - "fast list decoders for polar codes"
    - "on the construction and decoding of concatenated polar codes"
    - "list decoding of polar codes"
    - "how to construct polar codes"
    - "a practical approach to polar codes"
    - "concatenated 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 "ber performance of polar coded ofdm in multipath fading"):
  with members:
    - "polar coding for processes with memory"
    - "llr based successive cancellation list decoding of polar codes"
    - "list decoding of polar codes"
    - "how to construct polar codes"

Connected through hyperedge HE-8 (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"
    - "a reduced latency list decoding algorithm for polar codes"
    - "a scalable successive cancellation decoder for polar codes"
    - "an efficient list decoder architecture 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.IT(Information Theory)