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 "effects of single cycle structure on iterative decoding of low density parity check codes"):
  Abstract: We consider communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) codes and belief propagation (BP) decoding. For fixed numbers of BP iterations, the bit error probability approaches a limit as the blocklength tends to infinity, and the limit is obtained via density evolution. The finite-blocklength correction behaves like α(e,t)/n+Θ(n-2) as the blocklength n tends to infinity where α(e,t) denotes a specific constant determined by the code ensemble considered, the number t of iterations, and the erasure probability e of the BEC. In this paper, we derive a set of recursive formulas which allows the evaluation of the constant α(e,t) for standard irregular ensembles. The dominant difference α(e,t)/n can be considered as effects of cycle-free and single-cycle structures of local graphs. Furthermore, it is confirmed via numerical simulations that estimation of the bit error probability using α(e,t) is accurate even for small blocklengths.

Includes members:
  Member "finite length analysis of irregular expurgated ldpc codes under finite number of iterations":
    also connected through other hyperedges:
      (none)
  Member "how to find good finite length codes from art towards science":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "compressed sensing of approximately sparse signals phase transitions and optimal reconstruction")
  Member "maxwell construction the hidden bridge between iterative and maximum a posteriori decoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reed muller codes theory and algorithms")
  Member "the generalized area theorem and some of its consequences":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reed muller codes theory and algorithms")
  Member "finite length scaling for iteratively decoded ldpc ensembles":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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)