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 "distributed evaluation of subgraph queries using worstcase optimal lowmemory dataflows"):
  Abstract: We study the problem of finding and monitoring fixed-size subgraphs in a continually changing large-scale graph. We present the first approach that (i) performs worst-case optimal computation and communication, (ii) maintains a total memory footprint linear in the number of input edges, and (iii) scales down per-worker computation, communication, and memory requirements linearly as the number of workers increases, even on adversarially skewed inputs. #R##N#Our approach is based on worst-case optimal join algorithms, recast as a data-parallel dataflow computation. We describe the general algorithm and modifications that make it robust to skewed data, prove theoretical bounds on its resource requirements in the massively parallel computing model, and implement and evaluate it on graphs containing as many as 64 billion edges. The underlying algorithm and ideas generalize from finding and monitoring subgraphs to the more general problem of computing and maintaining relational equi-joins over dynamic relations.

Includes members:
  Member "size bounds and query plans for relational joins":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complexity analysis of general and fractional hypertree decompositions")
  Member "worst case optimal algorithms for parallel query processing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "instance and output optimal parallel algorithms for acyclic joins")
  Member "incremental maintenance for leapfrog triejoin":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "join processing for graph patterns an old dog with new tricks")
  Member "skew strikes back new developments in the theory of join algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fast join project query evaluation using matrix multiplication")
  Member "communication steps for parallel query processing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "tri tri again finding triangles and small subgraphs in a distributed setting":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "parallel algorithms for small subgraph counting")
  Member "leapfrog triejoin a worst case optimal join algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fast join project query evaluation using matrix multiplication")
  Member "dbtoaster higher order delta processing for dynamic frequently fresh views":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "multi layer optimizations for end to end data analytics")

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)