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 "parallel correctness and containment for conjunctive queries with union and negation"):
  Abstract: Single-round multiway join algorithms first reshuffle data over many servers and then evaluate the query at hand in a parallel and communication-free way. A key question is whether a given distribution policy for the reshuffle is adequate for computing a given query, also referred to as parallel-correctness. This paper extends the study of the complexity of parallel-correctness and its constituents, parallel-soundness and parallel-completeness, to unions of conjunctive queries with and without negation. As a by-product it is shown that the containment problem for conjunctive queries with negation is coNEXPTIME-complete.

Includes members:
  Member "parallel correctness and transferability for conjunctive queries":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a case for stale synchronous distributed model for declarative recursive computation")
  Member "skew in parallel query processing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "parallel algorithms for small subgraph counting")
  Member "communication steps for parallel query processing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "win move is coordination free sometimes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "putting logic based distributed systems on stable grounds")
  Member "shark sql and rich analytics at scale":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "knowledge graphs")
  Member "relational transducers for declarative networking":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "keeping calm when distributed consistency is easy")

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.DB(Databases)