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: "efficient bit channel reliability computation for multi mode polar code encoders and decoders"
  Abstract: Polar codes are a family of capacity-achieving error-correcting codes, and they have been selected as part of the next generation wireless communication standard. Each polar code bit-channel is assigned a reliability value, used to determine which bits transmit information and which parity. Relative reliabilities need to be known by both encoders and decoders: in case of multi-mode systems, where multiple code lengths and code rates are supported, the storage of relative reliabilities can lead to high implementation complexity. In this work, observe patterns among code reliabilities. We propose an approximate computation technique to easily represent the reliabilities of multiple codes, through a limited set of variables and update rules. The proposed method allows to tune the trade-off between reliability accuracy and implementation complexity. An approximate computation architecture for encoders and decoders is designed and implemented, showing 50.7% less area occupation than storage-based solutions, with less than 0.05 dB error correction performance degradation.

Connected through hyperedge HE-1 (induced by source paper "rate flexible fast polar decoders"):
  with members:
    - "llr based successive cancellation list decoder for polar codes with multibit decision"
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "beta expansion a theoretical framework for fast and recursive construction of polar codes"
    - "a high throughput list decoder architecture for polar codes"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "construction of polar codes with sublinear complexity"
    - "symbol decision successive cancellation list decoder for polar codes"
    - "a comparative study of polar code constructions for the awgn channel"

Connected through hyperedge HE-2 (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"

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)