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 versus complexity per iteration for low density parity check codes an information theoretic approach"):
  Abstract: The paper is focused on the tradeoff between performance and decoding complexity per iteration for LDPC codes in terms of their gap (in rate) to capacity. The study of this tradeoff is done via information-theoretic bounds which also enable to get an indication on the sub-optimality of message-passing iterative decoding algorithms (as compared to optimal ML decoding). The bounds are generalized for parallel channels, and are applied to ensembles of punctured LDPC codes where both intentional and random puncturing are addressed. This work suggests an improvement in the tightness of some information-theoretic bounds which were previously derived by Burshtein et al. and by Sason and Urbanke.

Includes members:
  Member "maxwell construction the hidden bridge between iterative and maximum a posteriori decoding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reed muller codes theory and algorithms")
  Member "accumulate repeat accumulate codes systematic codes achieving the binary erasure channel capacity with bounded complexity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tradeoff between decoding complexity and rate for codes on graphs")
  Member "capacity achieving codes with bounded graphical complexity on noisy channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on universal properties of capacity approaching ldpc code ensembles")
  Member "improved bounds on the parity check density and achievable rates of binary linear block codes with applications to ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the generalized area theorem and some of its consequences")
  Member "on achievable rates and complexity of ldpc codes for parallel channels with application to puncturing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on achievable rates and complexity of ldpc codes for parallel channels information theoretic bounds and applications")
  Member "why we can not surpass capacity the matching condition":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "iterative decoding performance bounds for ldpc codes on noisy channels")
  Member "capacity achieving ensembles for the binary erasure channel with bounded complexity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "log logarithmic time pruned polar coding")
  Member "life above threshold from list decoding to area theorem and mse":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "low density majority codes and the problem of graceful degradation")

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)