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 "a fundamental storage communication tradeoff in distributed computing with straggling nodes"):
  Abstract: The optimal storage-computation tradeoff is characterized for a MapReduce-like distributed computing system with straggling nodes, where only a part of the nodes can be utilized to compute the desired output functions. The result holds for arbitrary output functions and thus generalizes previous results that restricted to linear functions. Specifically, in this work, we propose a new information-theoretical converse and a new matching coded computing scheme, that we call coded computing for straggling systems (CCS).

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 "storage computation and communication a fundamental tradeoff in distributed computing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "coded distributed computing schemes with smaller numbers of input files and output functions")
  Member "speeding up distributed gradient descent by utilizing non persistent stragglers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "timely distributed computation with stragglers")
  Member "hierarchical coding for distributed computing":
    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 "placement delivery array design through strong edge coloring of bipartite graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "coded federated computing in wireless networks with straggling devices and imperfect csi")
  Member "coded distributed computing with node cooperation substantially increases speedup factors":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamental limits of caching in heterogeneous networks with uncoded prefetching")
  Member "straggler mitigation in distributed matrix multiplication fundamental limits and optimal coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")

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)