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: "numerical issues affecting ldpc error floors"
  Abstract: Numerical issues related to the occurrence of error floors in floating-point simulations of belief propagation (BP) decoders are examined. Careful processing of messages corresponding to highly-certain bit values can sometimes reduce error floors by several orders of magnitude. Computational solutions for properly handling such messages are provided for the sum-product algorithm (SPA) and several variants.

Connected through hyperedge HE-1 (induced by source paper "prototyping software transceiver for the 5g new radio physical uplink shared channel"):
  with members:
    - "on the phase tracking reference signal pt rs design for 5g new radio nr"

Connected through hyperedge HE-2 (induced by source paper "error floor approximation for ldpc codes in the awgn channel"):
  with members:
    - "ldpc code density evolution in the error floor region"
    - "the sum product algorithm for degree 2 check nodes and trapping sets"
    - "controlling the error floor in ldpc decoding"
    - "quantized iterative message passing decoders with low error floor for ldpc codes"
    - "on the dynamics of the error floor behavior in regular ldpc codes"
    - "the trapping redundancy of linear block codes"
    - "informed dynamic scheduling for belief propagation decoding of ldpc codes"
    - "a general method for finding low error rates of ldpc codes"

Connected through hyperedge HE-3 (induced by source paper "quantized iterative message passing decoders with low error floor for ldpc codes"):
  with members:
    - "error floor approximation for ldpc codes in the awgn channel"
    - "multilevel decoders surpassing belief propagation on the binary symmetric channel"
    - "iterative ldpc decoding using neighborhood reliabilities"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc 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)