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 "modeling and energy optimization of ldpc decoder circuits with timing violations"):
  Abstract: This paper proposes a "quasi-synchronous" design approach for signal processing circuits, in which timing violations are permitted, but without the need for a hardware compensation mechanism. The case of a low-density parity-check (LDPC) decoder is studied, and a method for accurately modeling the effect of timing violations at a high level of abstraction is presented. The error-correction performance of code ensembles is then evaluated using density evolution while taking into account the effect of timing faults. Following this, several quasi-synchronous LDPC decoder circuits based on the offset min-sum algorithm are optimized, providing a 23%-40% reduction in energy consumption or energy-delay product, while achieving the same performance and occupying the same area as conventional synchronous circuits.

Includes members:
  Member "on the total power capacity of regular ldpc codes with iterative message passing decoders":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy latency and reliability tradeoffs in coding circuits")
  Member "on the energy complexity of ldpc decoder circuits":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy latency and reliability tradeoffs in coding circuits")
  Member "analysis and design of finite alphabet iterative decoders robust to faulty hardware":
    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 "density evolution for min sum decoding of ldpc codes under unreliable message storage":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "majority logic decoding under data dependent logic gate failures")
  Member "energy consumption of vlsi decoders":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "compressive sensing based user clustering for downlink noma systems with decoding power")
  Member "performance of ldpc codes under faulty iterative decoding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)