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 schemes with smaller numbers of input files and output functions"):
  Abstract: Li et al. (IEEE Transaction on Information Theory, 64, 109-128, 2018) introduced coded distributed computing (CDC) to reduce the communication load in general distributed computing frameworks such as MapReduce, Hadoop and Spark. They also proposed CDC schemes with minimal computation load for fixed computation load. However, these schemes require exponentially large numbers of input files and output functions when the number of computing nodes gets large. In this paper, we give a construction of CDC schemes based on placement dilevery arrays (PDAs), which was introduced to study coded caching schemes. Consequently, based on known results of PDAs, several CDC schemes can be obtained. Most importantly, the minimal number of output functions in all the new schemes are only a factor of the number of computing nodes, and the minimal number of input files in our new schemes is much smaller than that of CDC schemes derived by Li et al.

Includes members:
  Member "resolvable designs for speeding up distributed computing":
    also connected through other hyperedges:
      (none)
  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 "low complexity distributed computing via binary matrices with extension to stragglers")
  Member "coded computing for distributed graph analytics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "timely throughput optimal coded computing over cloud networks")
  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 "compressed coded distributed computing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "resolvable designs for speeding up distributed computing")
  Member "a new combinatorial design of coded distributed computing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "heterogeneous coded distributed computing joint design of file allocation and function assignment")
  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")

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)