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 "universal rateless codes from coupled lt codes"):
  Abstract: It was recently shown that spatial coupling of individual low-density parity-check codes improves the belief-propagation threshold of the coupled ensemble essentially to the maximum a posteriori threshold of the underlying ensemble. We study the performance of spatially coupled low-density generator-matrix ensembles when used for transmission over binary-input memoryless output-symmetric channels. We show by means of density evolution that the threshold saturation phenomenon also takes place in this setting. Our motivation for studying low-density generator-matrix codes is that they can easily be converted into rateless codes. Although there are already several classes of excellent rateless codes known to date, rateless codes constructed via spatial coupling might offer some additional advantages. In particular, by the very nature of the threshold phenomenon one expects that codes constructed on this principle can be made to be universal, i.e., a single construction can uniformly approach capacity over the class of binary-input memoryless output-symmetric channels. We discuss some necessary conditions on the degree distribution which universal rateless codes based on the threshold phenomenon have to fulfill. We then show by means of density evolution and some simulation results that indeed codes constructed in this way perform very well over a whole range of channel types and channel conditions.

Includes members:
  Member "chains of mean field models":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "universal sparse superposition codes with spatial coupling and gamp decoding")
  Member "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "coupled graphical models and their thresholds":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "rank one matrix estimation analysis of algorithmic and information theoretic limits by the spatial coupling method")
  Member "asymptotically regular ldpc codes with linear distance growth and thresholds close to capacity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spatially coupled ldpc codes constructed from protographs")
  Member "threshold saturation on bms channels via spatial coupling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "systematic convolutional low density generator matrix code")
  Member "terminated ldpc convolutional codes with thresholds close to capacity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "design and analysis of time invariant sc ldpc convolutional codes with small constraint length")

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)