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: "xj bp express journey belief propagation decoding for polar codes"
  Abstract: This paper presents a novel propagation (BP) based decoding algorithm for polar codes. The proposed algorithm facilitates belief propagation by utilizing the specific constituent codes that exist in the factor graph, which results in an express journey (XJ) for belief information to propagate in each decoding iteration. In addition, this XJ-BP decoder employs a novel round-trip message passing scheduling method for the increased efficiency. The proposed method simplifies min-sum (MS) BP decoder by 40.6%. Along with the round-trip scheduling, the XJ-BP algorithm reduces the computational complexity of MS BP decoding by 90.4%; this enables an energy-efficient hardware implementation of BP decoding in practice.

Connected through hyperedge HE-1 (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-2 (induced by source paper "concatenated ldpc polar codes decoding through belief propagation"):
  with members:
    - "llr based successive cancellation list decoding of polar codes"
    - "reduced complexity belief propagation decoders for polar codes"
    - "on finite length performance of polar codes stopping sets error floor and concatenated design"
    - "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-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"
    - "tc throughput centric successive cancellation decoder hardware implementation 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"
    - "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"
    - "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 "flexible length polar codes through graph based augmentation"):
  with members:
    - "improving belief propagation decoding of polar codes using scattered exit charts"
    - "list decoding of polar codes"
    - "how to construct polar codes"

Connected through hyperedge HE-6 (induced by source paper "overlapped list successive cancellation approach for hardware efficient polar code decoder"):
  with members:
    - "tc throughput centric successive cancellation decoder hardware implementation 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"

Connected through hyperedge HE-7 (induced by source paper "tc throughput centric successive cancellation decoder hardware implementation for polar codes"):
  with members:
    - "fast polar decoders algorithm and implementation"
    - "list decoding of polar codes"
    - "how to construct polar codes"
    - "reduced latency sc polar decoder architectures"
    - "hardware architectures for successive cancellation 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)