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: "flexible and low complexity encoding and decoding of systematic polar codes"
  Abstract: In this paper, we present hardware and software implementations of flexible polar systematic encoders and decoders. The proposed implementations operate on polar codes of any length less than a maximum and of any rate. We describe the low-complexity, highly parallel, and flexible systematic-encoding algorithm that we use and prove its correctness. Our hardware implementation results show that the overhead of adding code rate and length flexibility is little, and the impact on operation latency minor compared with code-specific versions. Finally, the flexible software encoder and decoder implementations are also shown to be able to maintain high throughput and low latency.

Connected through hyperedge HE-1 (induced by source paper "polar codes and their quantum domain counterparts"):
  with members:
    - "reinforcement learning for nested polar code construction"
    - "decoder tailored polar code design using the genetic algorithm"
    - "genetic algorithm based polar code construction for the awgn channel"
    - "improved bit flipping algorithm for successive cancellation decoding of polar codes"
    - "design of polar codes in 5g new radio"
    - "belief propagation decoding of polar codes on permuted factor graphs"
    - "improved successive cancellation flip decoding of polar codes based on error distribution"
    - "belief propagation list decoding of polar codes"

Connected through hyperedge HE-2 (induced by source paper "rate matching for polar codes based on binary domination"):
  with members:
    - "circular buffer rate matched polar codes"
    - "on puncturing strategies for polar codes"
    - "low complexity puncturing and shortening of polar codes"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "capacity achieving rate compatible polar codes"
    - "polar codes with dynamic frozen symbols and their decoding by directed search"
    - "on the construction and decoding of concatenated polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-3 (induced by source paper "a general construction and encoder implementation of polar codes"):
  with members:
    - "auto generation of pipelined hardware designs for polar encoder"
    - "low complexity puncturing and shortening of polar codes"
    - "rate compatible punctured polar codes optimal construction based on polar spectra"
    - "does gaussian approximation work well for the long length polar code construction"
    - "how to construct polar codes"
    - "a practical approach to polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"

Connected through hyperedge HE-4 (induced by source paper "design of polar codes in 5g new radio"):
  with members:
    - "on list decoding of 5g nr polar codes"
    - "parity check polar coding for 5g and beyond"
    - "design and implementation of a polar codes blind detection scheme"
    - "circular buffer rate matched polar codes"
    - "improved successive cancellation flip decoding of polar codes based on error distribution"
    - "partitioned list decoding of polar codes analysis and improvement of finite length performance"
    - "on the error probability of short concatenated polar and cyclic codes with interleaving"
    - "on puncturing strategies for polar codes"

Connected through hyperedge HE-5 (induced by source paper "circular buffer rate matched polar codes"):
  with members:
    - "recursive constructions and their maximum likelihood decoding"
    - "relaxed polar codes"
    - "binary polar codes are optimised codes for bitwise multistage decoding"
    - "multi kernel construction of polar codes"
    - "rate compatible polar codes for wireless channels"
    - "capacity achieving rateless polar codes"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "from polar to reed muller codes a technique to improve the finite length performance"

Connected through hyperedge HE-6 (induced by source paper "towards practical software stack decoding of polar codes"):
  with members:
    - "fast sequential decoding of polar codes"
    - "fast list decoders for polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "fast polar decoders algorithm and implementation"
    - "improved successive cancellation decoding of polar codes"
    - "partial sums computation in polar codes decoding"
    - "list decoding of polar codes"
    - "hardware architectures for successive cancellation decoding of polar codes"

Connected through hyperedge HE-7 (induced by source paper "channel estimation with systematic polar codes"):
  with members:
    - "improved successive cancellation decoding of polar codes"
    - "list decoding of polar codes"
    - "how to construct polar codes"
    - "a practical approach to polar codes"
    - "performance of polar codes for channel and source coding"

Connected through hyperedge HE-8 (induced by source paper "a novel high rate polar staircase coding scheme"):
  with members:
    - "information rates of next generation long haul optical fiber systems using coded modulation"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "list decoding of polar codes"
    - "staircase codes fec for 100 gb s otn"

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)