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: "overlapped list successive cancellation approach for hardware efficient polar code decoder"
  Abstract: This paper presents an efficient hardware design approach for list successive cancellation (LSC) decoding of polar codes. By applying path-overlapping scheme, the l instances of (l > 1) successive cancellation (SC) decoder for LSC with list size l can be cut down to only one. This results in a dramatic reduction of the hardware complexity without any decoding performance loss. We also develop novel approaches to reduce the latencyassociated with the pipeline scheme. Simulation results show that with proposed design approach the hardware efficiency is increased significantly over the recently proposed LSC decoders.

Connected through hyperedge HE-1 (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"
    - "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-2 (induced by source paper "an efficient partial sums generator for constituent code based successive cancellation decoding of polar codes"):
  with members:
    - "tc throughput centric successive cancellation decoder hardware implementation 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"
    - "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"

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)