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 "storage computation and communication a fundamental tradeoff in distributed computing"):
  Abstract: Distributed computing has become one of the most important frameworks in dealing with large computation tasks. In this paper, we investigate a MapReduce like distributed computing system. Our main contribution is the characterization of the optimal tradeoff between storage space, computation load, and communication load. To this end, we derive an information-theoretical converse and show that time- and memory- sharing between the operating points achieved by the modified coded distributed computing (M-CDC) scheme proposed by Ezzeldin et al. attains all the points on this tradeoff. Our result thus extends the result by Li et al. on the optimum tradeoff between storage and communication to account also for the computation load. We further show how to obtain a distributed computing scheme from any placement delivery array (PDA) whose ordinary symbols occur at least twice. Previously proposed PDAs to solve the subpacketization problem in coded caching by Yan et al. and Shangguan et al. allow us then to derive optimal distributed computing schemes that require only a small number of files, and thus have reduced complexity.

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 "placement delivery array design through strong edge coloring of bipartite graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "a storage computation communication tradeoff for distributed computing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a fundamental storage communication tradeoff in distributed computing with straggling nodes")
  Member "coded distributed computing with node cooperation substantially increases speedup factors":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a fundamental storage communication tradeoff in distributed computing with straggling nodes")
  Member "straggler mitigation in distributed matrix multiplication fundamental limits and optimal coding":
    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 "polynomial codes an optimal design for high dimensional coded matrix multiplication":
    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 "communication vs distributed computation an alternative trade off curve":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "low complexity distributed computing via binary matrices with extension to stragglers")

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)