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 "low latency data sharing in erasure multi way relay channels"):
  Abstract: We consider an erasure multi-way relay channel (EMWRC) in which several users share their data through a relay over erasure links. Assuming no feedback channel between the users and the relay, we first identify the challenges for designing a data sharing scheme over an EMWRC. Then, to overcome these challenges, we propose practical low-latency and low-complexity data sharing schemes based on fountain coding. Later, we introduce the notion of end-to-end erasure rate (EEER) and analytically derive it for the proposed schemes. EEER is then used to calculate the achievable rate and transmission overhead of the proposed schemes. Using EEER and computer simulations, the achievable rates and transmission overhead of our proposed schemes are compared with the ones of one-way relaying. This comparison implies that when the number of users and the channel erasure rates are not large, our proposed schemes outperform one-way relaying. We also find an upper bound on the achievable rates of EMWRC and observe that depending on the number of users and channel erasure rates, our proposed solutions can perform very close to this bound.

Includes members:
  Member "on modulo sum computation over an erasure multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "probabilistic rateless multiple access for machine to machine communication")
  Member "joint compute and forward for the two way relay channel with spatially coupled ldpc codes":
    also connected through other hyperedges:
      (none)
  Member "an optimal coding strategy for the binary multi way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "maximizing data rate for multiway relay channels with pairwise transmission strategy")
  Member "the multi way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi agent reinforcement learning for energy harvesting two hop communications with full cooperation")
  Member "capacity theorems for the awgn multi way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "three way channels with multiple unicast sessions capacity approximation via network transformation")
  Member "intermediate performance of rateless codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)