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: "tc throughput centric successive cancellation decoder hardware implementation for polar codes"
  Abstract: This paper presents a hardware architecture of fast simplified successive cancellation (fast-SSC) algorithm for polar codes, which significantly reduces the decoding latency and dramatically increases the throughput. Algorithmically, fast-SSC algorithm suffers from the fact that its decoder scheduling and the consequent architecture depends on the code rate; this is a challenge for rate-compatible system. However, by exploiting the homogeneousness between the decoding processes of fast constituent polar codes and regular polar codes, the presented design is compatible with any rate. The scheduling plan and the intendedly designed process core are also described. Results show that, compared with the state-of-art decoder, proposed design can achieve at least 60% latency reduction for the codes with length N = 1024. By using Nangate FreePDK 45nm process, proposed design can reach throughput up to 5.81 Gbps and 2.01 Gbps for (1024, 870) and (1024, 512) polar code, respectively.

Connected through hyperedge HE-1 (induced by source paper "a multi kernel multi code polar decoder architecture"):
  with members:
    - "on puncturing strategies for polar codes"
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "low complexity puncturing and shortening of polar codes"
    - "minimum distance based construction of multi kernel polar codes"
    - "multi mode unrolled architectures for polar decoders"
    - "multi kernel construction of polar codes"
    - "fast polar decoders algorithm and implementation"
    - "binary polarization kernels from code decompositions"

Connected through hyperedge HE-2 (induced by source paper "comparison of polar decoders with existing low density parity check and turbo decoders"):
  with members:
    - "fast low complexity decoders for low rate polar codes"
    - "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"

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 low complexity decoders for low rate polar codes"
    - "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"
    - "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 "an efficient partial sums generator for constituent code based successive cancellation decoding of polar codes"):
  with members:
    - "overlapped list successive cancellation approach for hardware efficient polar code decoder"
    - "llr based successive cancellation list decoding of polar codes"
    - "a hybrid partial sum computation unit architecture for list decoders of polar codes"
    - "xj bp express journey belief propagation decoding for polar codes"
    - "fast polar decoders algorithm and implementation"
    - "partial sums generation architecture for successive cancellation decoding of polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-5 (induced by source paper "overlapped list successive cancellation approach for hardware efficient polar code decoder"):
  with members:
    - "xj bp express journey belief propagation decoding for polar codes"
    - "unrolled polar decoders part ii fast list decoders"
    - "symbol based successive cancellation list decoder for polar codes"
    - "low latency successive cancellation list decoders for polar codes with multi bit decision"
    - "list decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "performance of polar codes for channel and source coding"

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)