human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "loopy belief propagation as a basis for communication in sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deep coordination graphs")
  Member "the price of certainty waterslide curves and the gap to capacity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adaptivity provably helps information theoretic limits on l_0 cost of non adaptive sensing")
  Member "channel coding the road to channel capacity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "the extraction and complexity limits of graphical models for linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on pseudocodewords and decision regions of linear programming decoding of hdpc codes")
  Member "tight bounds for ldpc and ldgm codes under map decoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "accuracy memory tradeoffs and phase transitions in belief propagation")
  Member "capacity achieving ensembles for the binary erasure channel with bounded complexity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "log logarithmic time pruned polar coding")
  Member "density evolution thresholds and the stability condition for non binary ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multi edge type ldpc code design with g exit charts for continuous variable quantum key distribution")

Question: Please tell me which class the source paper 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)