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 "high level programming abstractions for distributed graph processing"):
  Abstract: Efficient processing of large-scale graphs in distributed environments has been an increasingly popular topic of research in recent years. Inter-connected data that can be modeled as graphs appear in application domains such as machine learning, recommendation, web search, and social network analysis. Writing distributed graph applications is inherently hard and requires programming models that can cover a diverse set of problems, including iterative refinement algorithms, graph transformations, graph aggregations, pattern matching, ego-network analysis, and graph traversals. Several high-level programming abstractions have been proposed and adopted by distributed graph processing systems and big data platforms. Even though significant work has been done to experimentally compare distributed graph processing frameworks, no qualitative study and comparison of graph programming abstractions has been conducted yet. In this survey, we review and analyze the most prevalent high-level programming models for distributed graph processing, in terms of their semantics and applicability. We review 34 distributed graph processing systems with respect to the graph processing models they implement and we survey applications that appear in recent distributed graph systems papers. Finally, we discuss trends and open research questions in the area of distributed graph processing.

Includes members:
  Member "the gremlin graph traversal machine and language invited talk":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "knowledge graphs")
  Member "effective techniques for message reduction and load balancing in distributed graph computation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "graph3s a simple speedy and scalable distributed graph processing system")
  Member "goffish a sub graph centric framework for large scale graph analytics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a distributed path query engine for temporal property graphs")
  Member "nscale neighborhood centric large scale graph analytics in the cloud":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "graph3s a simple speedy and scalable distributed graph processing system")
  Member "pregelix big ger graph analytics on a dataflow engine":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "graph3s a simple speedy and scalable distributed graph processing system")
  Member "spinning fast iterative data flows":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey of state management in big data processing systems")

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.DC(Distributed, Parallel, and Cluster Computing)