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: "on error correction performance and implementation of polar code list decoders for 5g"
  Abstract: Polar codes are a class of capacity achieving error correcting codes that has been recently selected for the next generation of wireless communication standards (5G). Polar code decoding algorithms have evolved in various directions, striking different balances between error-correction performance, speed and complexity. Successive-cancellation list (SCL) and its incarnations constitute a powerful, well-studied set of algorithms, in constant improvement. At the same time, different implementation approaches provide a wide range of area occupations and latency results. 5G puts a focus on improved error-correction performance, high throughput and low power consumption: a comprehensive study considering all these metrics is currently lacking in literature. In this work, we evaluate SCL-based decoding algorithms in terms of error-correction performance and compare them to low-density parity-check (LDPC) codes. Moreover, we consider various decoder implementations, for both polar and LDPC codes, and compare their area occupation and power and energy consumption when targeting short code lengths and rates. Our work shows that among SCL-based decoders, the partitioned SCL (PSCL) provides the lowest area occupation and power consumption, whereas fast simplified SCL (Fast-SSCL) yields the lowest energy consumption. Compared to LDPC decoder architectures, different SCL implementations occupy up to 17.1x less area, dissipate up to 7.35x less power, and up to 26x less energy.

Connected through hyperedge HE-1 (induced by source paper "general strong polarization"):
  with members:
    - "binary linear codes with optimal scaling and quasi linear complexity"
    - "near optimal finite length scaling for polar codes over large alphabets"
    - "polar codes for broadcast channels"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "finite length scaling for polar codes"
    - "an entropy sumset inequality and polynomially fast convergence to shannon capacity over all alphabets"
    - "polar coding for interference networks"
    - "polar codes speed of polarization and polynomial gap to capacity"

Connected through hyperedge HE-2 (induced by source paper "improved bit flipping algorithm for successive cancellation decoding of polar codes"):
  with members:
    - "partitioned successive cancellation flip decoding of polar codes"
    - "improved successive cancellation flip decoding of polar codes based on error distribution"
    - "dynamic scflip decoding of polar codes"
    - "an improved scflip decoder for polar codes"
    - "partitioned list decoding of polar codes analysis and improvement of finite length performance"
    - "polarbear a 28 nm fd soi asic for decoding of polar codes"
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "progressive bit flipping decoding of polar codes over layered critical sets"

Connected through hyperedge HE-3 (induced by source paper "partitioned successive cancellation flip decoding of polar codes"):
  with members:
    - "dynamic scflip decoding of polar codes"
    - "an improved scflip decoder for polar codes"
    - "partitioned list decoding of polar codes analysis and improvement of finite length performance"
    - "partitioned successive cancellation list decoding of polar codes"
    - "a low complexity improved successive cancellation decoder for polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-4 (induced by source paper "5g nr jamming spoofing and sniffing threat assessment and mitigation"):
  with members:
    - "lte phy layer vulnerability analysis and testing using open source sdr tools"
    - "performance analysis of a mission critical portable lte system in targeted rf interference"
    - "lte security protocol exploits and location tracking experimentation with low cost software radio"
    - "practical attacks against privacy and availability in 4g lte mobile communication systems"
    - "vulnerability of lte to hostile interference"

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)