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 "query answering under matching dependencies for data cleaning complexity and algorithms"):
  Abstract: Matching dependencies (MDs) have been recently introduced as declarative rules for entity resolution (ER), i.e. for identifying and resolving duplicates in relational instance $D$. A set of MDs can be used as the basis for a possibly non-deterministic mechanism that computes a duplicate-free instance from $D$. The possible results of this process are the clean, "minimally resolved instances" (MRIs). There might be several MRIs for $D$, and the "resolved answers" to a query are those that are shared by all the MRIs. We investigate the problem of computing resolved answers. We look at various sets of MDs, developing syntactic criteria for determining (in)tractability of the resolved answer problem, including a dichotomy result. For some tractable classes of MDs and conjunctive queries, we present a query rewriting methodology that can be used to retrieve the resolved answers. We also investigate connections with "consistent query answering", deriving further tractability results for MD-based ER.

Includes members:
  Member "data cleaning and query answering with matching dependencies and matching functions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "holoclean holistic data repairs with probabilistic inference")
  Member "matching dependencies with arbitrary attribute values semantics query answering and integrity constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "principles of progress indicators for database repairing")
  Member "complexity of consistent query answering in databases under cardinality based and incremental repair semantics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "querying and repairing inconsistent prioritized knowledge bases complexity analysis and links with abstract argumentation")
  Member "answer sets for consistent query answering in inconsistent databases":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "abstract solvers for computing cautious consequences of asp programs")
  Member "minimal change integrity maintenance using tuple deletions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "complexity and efficient algorithms for data inconsistency evaluating and repairing")

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)