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: "density evolution for min sum decoding of ldpc codes under unreliable message storage"
  Abstract: We analyze the performance of quantized min-sum decoding of low-density parity-check codes under unreliable message storage. To this end, we introduce a simple bit-level error model and show that decoder symmetry is preserved under this model. Subsequently, we formulate the corresponding density evolution equations to predict the average bit error probability in the limit of infinite blocklength. We present numerical threshold results and we show that using more quantization bits is not always beneficial in the context of faulty decoders.

Connected through hyperedge HE-1 (induced by source paper "faulty successive cancellation decoding of polar codes for the binary erasure channel"):
  with members:
    - "analysis and design of finite alphabet iterative decoders robust to faulty hardware"
    - "density evolution and functional threshold for the noisy min sum decoder"
    - "on the correlation between polarized becs"
    - "polar codes robustness of the successive cancellation decoder with respect to quantization"
    - "hardware architectures for successive cancellation decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "performance of ldpc codes under faulty iterative decoding"

Connected through hyperedge HE-2 (induced by source paper "performance analysis based on density evolution on fault erasure belief propagation decoder"):
  with members:
    - "performance of ldpc codes under faulty iterative decoding"

Connected through hyperedge HE-3 (induced by source paper "computing linear transformations with unreliable components"):
  with members:
    - "speeding up distributed machine learning using codes"
    - "short dot computing large linear transforms distributedly using coded short dot products"
    - "information friction and its implications on minimum energy required for communication"
    - "density evolution and functional threshold for the noisy min sum decoder"
    - "energy consumption of vlsi decoders"
    - "coding with encoding uncertainty"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "on the capacity of noisy computations"

Connected through hyperedge HE-4 (induced by source paper "modeling and energy optimization of ldpc decoder circuits with timing violations"):
  with members:
    - "on the total power capacity of regular ldpc codes with iterative message passing decoders"
    - "on the energy complexity of ldpc decoder circuits"
    - "analysis and design of finite alphabet iterative decoders robust to faulty hardware"
    - "state dependent statistical timing model for voltage scaled circuits"
    - "energy consumption of vlsi decoders"
    - "performance of ldpc codes under faulty iterative decoding"

Connected through hyperedge HE-5 (induced by source paper "majority logic decoding under data dependent logic gate failures"):
  with members:
    - "modeling and energy optimization of ldpc decoder circuits with timing violations"
    - "density evolution and functional threshold for the noisy min sum decoder"
    - "state dependent statistical timing model for voltage scaled circuits"
    - "on trapping sets and guaranteed error correction capability of ldpc codes and gldpc codes"
    - "performance of ldpc codes under faulty iterative decoding"

Connected through hyperedge HE-6 (induced by source paper "analysis and design of finite alphabet iterative decoders robust to faulty hardware"):
  with members:
    - "density evolution and functional threshold for the noisy min sum decoder"
    - "performance of ldpc codes under faulty iterative decoding"
    - "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels"
    - "density evolution for asymmetric memoryless channels"

Connected through hyperedge HE-7 (induced by source paper "enabling complexity performance trade offs for successive cancellation decoding of polar codes"):
  with members:
    - "on the correlation between polarized becs"
    - "on the construction of polar codes"
    - "polar codes robustness of the successive cancellation decoder with respect to quantization"
    - "how to construct polar codes"
    - "the multiobjective multidimensional knapsack problem a survey and a new approach"
    - "hardware architectures for successive cancellation decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "performance of ldpc codes under faulty iterative decoding"

Connected through hyperedge HE-8 (induced by source paper "density evolution and functional threshold for the noisy min sum decoder"):
  with members:
    - "performance of ldpc codes under faulty iterative decoding"

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)