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 "design of irregular sc ldpc codes with non uniform degree distributions by linear programing"):
  Abstract: In this paper, we propose a new design method of irregular spatially-coupled low-density paritycheck (SC-LDPC) codes with non-uniform degree distributions by linear programming (LP). In general, irregular SC-LDPC codes with non-uniform degree distributions is difficult to design with low complexity because their density evolution equations are multi-dimensional. To solve the problem, the proposed method is based on two main ideas: a local design of the degree distributions for each pair of positions and pre-computation of the input/output message relationship. These ideas make it possible to design the degree distributions of irregular SC-LDPC codes by solving low complexity LP problems which are used when optimizing uncoupled low-density parity-check (LDPC) codes over the binary erasure channel. We also find a proper objective function for the proposed design methodology to improve the performance of SC-LDPC codes. It is shown that the irregular SC-LDPC codes obtained by the proposed method are superior to regular SC-LDPC codes in terms of both asymptotic and finite-length performances.

Includes members:
  Member "on the design of fast convergent ldpc codes for the bec an optimization approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a joint optimization technique for multi edge type ldpc codes")
  Member "spatially coupled ldpc codes constructed from protographs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "a scaling law to predict the finite length performance of spatially coupled ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec")
  Member "spatially coupled sparse codes on graphs theory and practice":
    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")
  Member "on the convergence speed of spatially coupled ldpc ensembles":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spatially coupled ldpc codes with non uniform coupling for improved decoding speed")
  Member "a simple proof of threshold saturation for coupled scalar recursions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "peeling close to the orientability threshold spatial coupling in hashing based data structures")
  Member "spatially coupled ensembles universally achieve capacity under belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "spatially coupled repeat accumulate codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "continuous transmission of spatially coupled ldpc code chains")

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)