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 "spatially coupled ldpc codes for decode and forward relaying of two correlated sources over the bec"):
  Abstract: We present a decode-and-forward transmission scheme based on spatially-coupled low-density parity-check (SC-LDPC) codes for a network consisting of two (possibly correlated) sources, one relay, and one destination. The links between the nodes are modeled as binary erasure channels. Joint source-channel coding with joint channel decoding is used to exploit the correlation. The relay performs network coding. We derive analytical bounds on the achievable rates for the binary erasure time-division multiple-access relay channel with correlated sources. We then design bilayer SC-LDPC codes and analyze their asymptotic performance for this scenario. We prove analytically that the proposed coding scheme achieves the theoretical limit for symmetric channel conditions and uncorrelated sources. Using density evolution, we furthermore demonstrate that our scheme approaches the theoretical limit also for non-symmetric channel conditions and when the sources are correlated, and we observe the threshold saturation effect that is typical for spatially-coupled systems. Finally, we give simulation results for large block lengths, which validate the DE analysis.

Includes members:
  Member "source channel coding theorems for the multiple access relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the secrecy capacity of gaussian mimo channels with finite memory full version")
  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 "universality for the noisy slepian wolf problem via spatial coupling":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "performance improvement of iterative multiuser detection for large sparsely spread cdma systems by spatial coupling")
  Member "bilayer ldpc convolutional codes for half duplex relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spatially coupled ldpc codes constructed from protographs")
  Member "ldpc code design for transmission of correlated sources across noisy channels without csit":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "code design for the noisy slepian wolf problem")
  Member "asymptotically regular ldpc codes with linear distance growth and thresholds close to capacity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spatially coupled ldpc codes constructed from protographs")
  Member "can iterative decoding for erasure correlated sources be universal":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "asymptotic analysis on ldpc bicm scheme for compute and forward relaying")
  Member "bilayer low density parity check codes for decode and forward in relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "capacity limits of full duplex cellular network")

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)