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 "majority logic decoding under data dependent logic gate failures"):
  Abstract: A majority logic decoder made of unreliable logic gates, whose failures are transient and datadependent, is analyzed. Based on a combinatorial representation of fault configurations a closed-form expression for the average bit error rate for an one-step majority logic decoder is derived, for a regular low-density parity-check (LDPC) code ensemble and the proposed failure model. The presented analysis framework is then used to establish bounds on the one-step majority logic decoder performance under the simplified probabilistic gate-output switching model. Based on the expander property of Tanner graphs of LDPC codes, it is proven that a version of the faulty parallel bit flipping decoder can correct a fixed fraction of channel errors in the presence of data-dependent gate failures. The results are illustrated with numerical examples of finite geometry codes.

Includes members:
  Member "modeling and energy optimization of ldpc decoder circuits with timing violations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a study of deep learning robustness against computation failures")
  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 "density evolution for min sum decoding of ldpc codes under unreliable message storage":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "faulty successive cancellation decoding of polar codes for the binary erasure channel")
  Member "state dependent statistical timing model for voltage scaled circuits":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "modeling and energy optimization of ldpc decoder circuits with timing violations")
  Member "on trapping sets and guaranteed error correction capability of ldpc codes and gldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "check hybrid gldpc codes systematic elimination of trapping sets and guaranteed error correction capability")
  Member "performance of ldpc codes under faulty iterative decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "exploiting errors for efficiency a survey from circuits to algorithms")

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)