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 "when distributed computation is communication expensive"):
  Abstract: We consider a number of fundamental statistical and graph problems in the message-passing model, where we have $k$ machines (sites), each holding a piece of data, and the machines want to jointly solve a problem defined on the union of the $k$ data sets. The communication is point-to-point, and the goal is to minimize the total communication among the $k$ machines. This model captures all point-to-point distributed computational models with respect to minimizing communication costs. Our analysis shows that exact computation of many statistical and graph problems in this distributed setting requires a prohibitively large amount of communication, and often one cannot improve upon the communication of the simple protocol in which all machines send their data to a centralized server. Thus, in order to obtain protocols that are communication-efficient, one has to allow approximation, or investigate the distribution or layout of the data sets.

Includes members:
  Member "communication steps for parallel query processing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "efficient protocols for distributed classification and optimization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed and streaming linear programming in low dimensions")
  Member "distributed learning communication complexity and privacy":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on distributed machine learning")
  Member "sorting searching and simulation in the mapreduce framework":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "randomized algorithms for tracking distributed count frequencies and ranks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards optimal moment estimation in streaming and distributed models")
  Member "lower bounds for number in hand multiparty communication complexity made easy":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "beyond alice and bob improved inapproximability for maximum independent set in congest")
  Member "tight bounds for distributed functional monitoring":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "towards optimal moment estimation in streaming and distributed models")

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.DS(Data Structures and Algorithms)