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 "on universal properties of capacity approaching ldpc code ensembles"):
  Abstract: This paper is focused on the derivation of some universal properties of capacity-approaching low-density parity-check (LDPC) code ensembles whose transmission takes place over memoryless binary-input output-symmetric (MBIOS) channels. Properties of the degree distributions, graphical complexity, and the number of fundamental cycles in the bipartite graphs are considered via the derivation of information-theoretic bounds. These bounds are expressed in terms of the target block/bit error probability and the gap (in rate) to capacity. Most of the bounds are general for any decoding algorithm, and some others are proved under belief propagation (BP) decoding. Proving these bounds under a certain decoding algorithm, validates them automatically also under any suboptimal decoding algorithm. A proper modification of these bounds makes them universal for the set of all MBIOS channels which exhibit a given capacity. Bounds on the degree distributions and graphical complexity apply to finite-length LDPC codes and to the asymptotic case of an infinite block length. The bounds are compared with capacity-approaching LDPC code ensembles under BP decoding, and they are shown to be informative and are easy to calculate. Finally, some interesting open problems are considered.

Includes members:
  Member "on the design of universal ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "performance prediction of nonbinary forward error correction in optical transmission experiments")
  Member "modern coding theory the statistical mechanics and computer science point of view":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the generalized random energy model and its application to the statistical physics of ensembles of hierarchical codes")
  Member "accumulate repeat accumulate codes capacity achieving ensembles of systematic codes for the erasure channel with bounded complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "log logarithmic time pruned polar coding")
  Member "channel coding the road to channel capacity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "how to find good finite length codes from art towards science":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "effects of single cycle structure on iterative decoding of low density parity check codes")
  Member "the generalized area theorem and some of its consequences":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reed muller codes theory and algorithms")
  Member "capacity achieving codes with bounded graphical complexity on noisy channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the price of certainty waterslide curves and the gap to capacity")
  Member "tight bounds for ldpc and ldgm codes under map decoding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "accuracy memory tradeoffs and phase transitions in belief propagation")

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)