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 decoders with missing connections"):
  Abstract: Due to process variation in nanoscale manufacturing, there may be permanently missing connections in information processing hardware. Due to timing errors in circuits, there may be missed messages in intra-chip communications, equivalent to transiently missing connections. In this paper, we investigate the performance of message-passing LDPC decoders in the presence of missing connections. We prove concentration and convergence theorems that validate the use of density evolution performance analysis. Arbitrarily small error probability is not possible with missing connections, but we find suitably defined decoding thresholds for communication systems with binary erasure channels under peeling decoding, as well as binary symmetric channels under Gallager A and B decoding. We see that decoding is robust to missing wires, as decoding thresholds degrade smoothly. Moreover, there is a stochastic facilitation effect in Gallager B decoders with missing connections. We also conduct finite-length simulations, compare the decoding sensitivity to channel noise and to missing wiring, and perform preliminary error-tolerant manufacturing yield analysis.

Includes members:
  Member "performance analysis based on density evolution on fault erasure belief propagation decoder":
    also connected through other hyperedges:
      (none)
  Member "analysis and design of finite alphabet iterative decoders robust to faulty hardware":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "faulty successive cancellation decoding of polar codes for the binary erasure channel")
  Member "density evolution and functional threshold for the noisy min sum decoder":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "faulty successive cancellation decoding of polar codes for the binary erasure channel")
  Member "noise facilitation in associative memories of exponential capacity":
    also connected through other hyperedges:
      (none)
  Member "limit on the addressability of fault tolerant nanowire decoders":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal q ary error correcting all unidirectional error detecting codes")
  Member "performance of ldpc codes under faulty iterative decoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "exploiting errors for efficiency a survey from circuits to algorithms")
  Member "iterative decoding of low density parity check codes a survey":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ldpc codes achieve list decoding capacity")
  Member "finite length scaling for iteratively decoded ldpc ensembles":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec")

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)