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 and functional threshold for the noisy min sum decoder"
  Abstract: This paper investigates the behavior of the Min-Sum decoder running on noisy devices. The aim is to evaluate the robustness of the decoder in the presence of computation noise, e.g. due to faulty logic in the processing units, which represents a new source of errors that may occur during the decoding process. To this end, we first introduce probabilistic models for the arithmetic and logic units of the the finite-precision Min-Sum decoder, and then carry out the density evolution analysis of the noisy Min-Sum decoder. We show that in some particular cases, the noise introduced by the device can help the Min-Sum decoder to escape from fixed points attractors, and may actually result in an increased correction capacity with respect to the noiseless decoder. We also reveal the existence of a specific threshold phenomenon, referred to as functional threshold. The behavior of the noisy decoder is demonstrated in the asymptotic limit of the code-length -- by using "noisy" density evolution equations -- and it is also verified in the finite-length case by Monte-Carlo simulation.

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 for min sum decoding of ldpc codes under unreliable message storage"
    - "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 of ldpc decoders with missing connections"):
  with members:
    - "performance analysis based on density evolution on fault erasure belief propagation decoder"
    - "analysis and design of finite alphabet iterative decoders robust to faulty hardware"
    - "noise facilitation in associative memories of exponential capacity"
    - "limit on the addressability of fault tolerant nanowire decoders"
    - "performance of ldpc codes under faulty iterative decoding"
    - "iterative decoding of low density parity check codes a survey"
    - "finite length scaling for iteratively decoded ldpc ensembles"

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 for min sum decoding of ldpc codes under unreliable message storage"
    - "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 "majority logic decoding under data dependent logic gate failures"):
  with members:
    - "modeling and energy optimization of ldpc decoder circuits with timing violations"
    - "density evolution for min sum decoding of ldpc codes under unreliable message storage"
    - "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-5 (induced by source paper "analysis and design of finite alphabet iterative decoders robust to faulty hardware"):
  with members:
    - "density evolution for min sum decoding of ldpc codes under unreliable message storage"
    - "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"

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)