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 "coded distributed computing over packet erasure channels"):
  Abstract: Coded computation is a framework which provides redundancy in distributed computing systems to speed up largescale tasks. Although most existing works assume an error-free scenarios in a master-worker setup, the link failures are common in current wired/wireless networks. In this paper, we consider the straggler problem in coded distributed computing with link failures, by modeling the links between the master node and worker nodes as packet erasure channels. When the master fails to detect the received signal, retransmission is required for each worker which increases the overall run-time to finish the task. We first investigate the expected overall run-time in this setting using an (n; k) maximum distance separable (MDS) code. We obtain the lower and upper bounds on the latency in closed-forms and give guidelines to design MDS code depending on the packet erasure probability. Finally, we consider a setup where the number of retransmissions is limited due to the bandwidth constraint. By formulating practical optimization problems related to latency, transmission bandwidth and probability of successful computation, we obtain achievable performance curves as a function of packet erasure probability.

Includes members:
  Member "speeding up distributed machine learning using codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "hierarchical coding for distributed computing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "exploitation of stragglers in coded computation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a locality based approach for coded computation")
  Member "polynomial codes an optimal design for high dimensional coded matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "latency analysis of coded computation schemes over wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "codenet training large scale neural networks in presence of soft errors")
  Member "coded convolution for parallel and distributed computing within a deadline":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "coded fourier transform":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "a fundamental tradeoff between computation and communication in distributed computing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")

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)