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: "comparison of polar decoders with existing low density parity check and turbo decoders"
  Abstract: Polar codes are a recently proposed family of provably capacity-achieving error-correction codes that received a lot of attention. While their theoretical properties render them interesting, their practicality compared to other types of codes has not been thoroughly studied. Towards this end, in this paper, we perform a comparison of polar decoders against LDPC and Turbo decoders that are used in existing communications standards. More specifically, we compare both the error-correction performance and the hardware efficiency of the corresponding hardware implementations. This comparison enables us to identify applications where polar codes are superior to existing error-correction coding solutions as well as to determine the most promising research direction in terms of the hardware implementation of polar decoders.

Connected through hyperedge HE-1 (induced by source paper "decoder tailored polar code design using the genetic algorithm"):
  with members:
    - "genetic algorithm based polar code construction for the awgn channel"
    - "design of polar codes in 5g new radio"
    - "belief propagation list decoding of polar codes"
    - "mitigating clipping effects on error floors under belief propagation decoding of polar codes"
    - "polar code construction for list decoding"
    - "minimum distance based construction of multi kernel polar codes"
    - "improving belief propagation decoding of polar codes using scattered exit charts"
    - "algebraic properties of polar codes from a new polynomial formalism"

Connected through hyperedge HE-2 (induced by source paper "mitigating clipping effects on error floors under belief propagation decoding of polar codes"):
  with members:
    - "on deep learning based channel decoding"
    - "improving belief propagation decoding of polar codes using scattered exit charts"
    - "combining belief propagation and successive cancellation list decoding of polar codes on a gpu platform"
    - "flexible length polar codes through graph based augmentation"
    - "reduced complexity belief propagation decoders for polar codes"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "the effect of saturation on belief propagation decoding of ldpc codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-3 (induced by source paper "energy efficient beam coordination strategies with rate dependent processing power"):
  with members:
    - "optimal policies for wireless networks with energy harvesting transmitters and receivers effects of decoding costs"
    - "energy efficient precoder design for mimo ofdm with rate dependent circuit power"
    - "pilot reuse for massive mimo transmission over spatially correlated rayleigh fading channels"
    - "energy efficient scheduling and power allocation in downlink ofdma networks with base station coordination"
    - "optimal design of energy efficient multi user mimo systems is massive mimo the answer"
    - "on the optimum energy efficiency for flat fading channels with rate dependent circuit power"
    - "a coordinated approach to channel estimation in large scale multiple antenna systems"
    - "fast converging algorithm for weighted sum rate maximization in multicell miso downlink"

Connected through hyperedge HE-4 (induced by source paper "polarbear a 28 nm fd soi asic for decoding of polar codes"):
  with members:
    - "multi mode unrolled architectures for polar decoders"
    - "a low latency list successive cancellation decoding implementation for polar codes"
    - "a high throughput list decoder architecture for polar codes"
    - "fast list decoders for polar codes"
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "on metric sorting for successive cancellation list decoding of polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "fast polar decoders algorithm and implementation"

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)