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: "multilevel decoders surpassing belief propagation on the binary symmetric channel"
  Abstract: In this paper, we propose a new class of quantized message-passing decoders for LDPC codes over the BSC. The messages take values (or levels) from a finite set. The update rules do not mimic belief propagation but instead are derived using the knowledge of trapping sets. We show that the update rules can be derived to correct certain error patterns that are uncorrectable by algorithms such as BP and min-sum. In some cases even with a small message set, these decoders can guarantee correction of a higher number of errors than BP and min-sum. We provide particularly good 3-bit decoders for 3-left-regular LDPC codes. They significantly outperform the BP and min-sum decoders, but more importantly, they achieve this at only a fraction of the complexity of the BP and min-sum decoders.

Connected through hyperedge HE-1 (induced by source paper "new decoding scheme for ldpc codes based on simple product code structure"):
  with members:
    - "lowering the error floor of ldpc codes using cyclic liftings"
    - "instanton based techniques for analysis and reduction of error floors of ldpc codes"

Connected through hyperedge HE-2 (induced by source paper "finite alphabet iterative decoders part ii towards guaranteed error correction of ldpc codes via iterative decoder diversity"):
  with members:
    - "ldpc codes which can correct three errors under iterative decoding"
    - "pseudocodewords of tanner graphs"

Connected through hyperedge HE-3 (induced by source paper "quantized iterative message passing decoders with low error floor for ldpc codes"):
  with members:
    - "numerical issues affecting ldpc error floors"
    - "error floor approximation for ldpc codes in the awgn channel"
    - "iterative ldpc decoding using neighborhood reliabilities"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-4 (induced by source paper "enhancing the error correction of finite alphabet iterative decoders via adaptive decimation"):
  with members:
    - "decimation enhanced finite alphabet iterative decoders for ldpc codes on the bsc"

Connected through hyperedge HE-5 (induced by source paper "decimation enhanced finite alphabet iterative decoders for ldpc codes on the bsc"):
  with members:
    - "guessing facets polytope structure and improved lp decoder"
    - "solving constraint satisfaction problems through belief propagation guided decimation"
    - "reducing the error floor"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"
    - "pseudocodewords of tanner graphs"

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)