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 "joint compute and forward for the two way relay channel with spatially coupled ldpc codes"):
  Abstract: We consider the design and analysis of coding schemes for the binary input two way relay channel with erasure noise. We focus on reliable physical layer network coding as described in [1] in which the relay performs perfect error correction prior to forwarding messages. The best known achievable rates for this problem can be achieved through either decode and forward or compute and forward relaying. We consider a decoding paradigm called joint compute and forward which we numerically show can achieve the best of these rates with a single encoder and decoder. This is accomplished by deriving the exact performance of a message passing decoder based on joint compute and forward for spatially coupled LDPC ensembles.

Includes members:
  Member "spatially coupled ensembles universally achieve capacity under belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "on modulo sum computation over an erasure multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "probabilistic rateless multiple access for machine to machine communication")
  Member "asynchronous physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an analysis of two user uplink asynchronous non orthogonal multiple access systems")
  Member "optimal decoding algorithm for asynchronous physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "differential distributed space time coding with imperfect synchronization in frequency selective channels")
  Member "reliable physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards massive connectivity support for scalable mmtc communications in 5g networks")
  Member "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "universal codes for the gaussian mac via spatial coupling":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "compressed coding amp based decoding and analog spatial coupling")
  Member "spatially coupled codes over the multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "ldpc coded multiuser shaping for the gaussian multiple access channel")

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)