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: "performance of ldpc codes under faulty iterative decoding"
  Abstract: Departing from traditional communication theory where decoding algorithms are assumed to perform without error, a system where noise perturbs both computational devices and communication channels is considered here. This paper studies limits in processing noisy signals with noisy circuits by investigating the effect of noise on standard iterative decoders for low-density parity-check codes. Concentration of decoding performance around its average is shown to hold when noise is introduced into message-passing and local computation. Density evolution equations for simple faulty iterative decoders are derived. In one model, computing nonlinear estimation thresholds shows that performance degrades smoothly as decoder noise increases, but arbitrarily small probability of error is not achievable. Probability of error may be driven to zero in another system model; the decoding threshold again decreases smoothly with decoder noise. As an application of the methods developed, an achievability result for reliable memory systems constructed from unreliable components is provided.

Connected through hyperedge HE-1 (induced by source paper "exploiting errors for efficiency a survey from circuits to algorithms"):
  with members:
    - "incremental color quantization for color vision deficient observers using mobile gaming data"
    - "probabilistic value deviation bounded integer codes for approximate communication"
    - "in datacenter performance analysis of a tensor processing unit"
    - "mobilenets efficient convolutional neural networks for mobile vision applications"
    - "squeezenet alexnet level accuracy with 50x fewer parameters and 0 5mb model size"
    - "reconfiguring the imaging pipeline for computer vision"
    - "matic learning around errors for efficient low voltage neural network accelerators"
    - "sound mixed precision optimization with rewriting"

Connected through hyperedge HE-2 (induced by source paper "coded iterative computing using substitute decoding"):
  with members:
    - "fundamental limits of coded linear transform"
    - "on the optimal recovery threshold of coded matrix multiplication"
    - "rateless codes for near perfect load balancing in distributed matrix vector multiplication"
    - "near optimal coded data shuffling for distributed learning"
    - "coded sparse matrix multiplication"
    - "straggler mitigation by delayed relaunch of tasks"
    - "polynomial codes an optimal design for high dimensional coded matrix multiplication"
    - "short dot computing large linear transforms distributedly using coded short dot products"

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

Connected through hyperedge HE-4 (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"
    - "density evolution and functional threshold for the noisy min sum decoder"
    - "noise facilitation in associative memories of exponential capacity"
    - "limit on the addressability of fault tolerant nanowire decoders"
    - "iterative decoding of low density parity check codes a survey"
    - "finite length scaling for iteratively decoded ldpc ensembles"

Connected through hyperedge HE-5 (induced by source paper "performance analysis based on density evolution on fault erasure belief propagation decoder"):
  with members:
    - "density evolution for min sum decoding of ldpc codes under unreliable message storage"

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

Connected through hyperedge HE-7 (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"
    - "density evolution for min sum decoding of ldpc codes under unreliable message storage"
    - "state dependent statistical timing model for voltage scaled circuits"
    - "energy consumption of vlsi decoders"

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

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)