human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "matching dependencies with arbitrary attribute values semantics query answering and integrity constraints"
  Abstract: Matching dependencies (MDs) were introduced to specify the identification or matching of certain attribute values in pairs of database tuples when some similarity conditions are satisfied. Their enforcement can be seen as a natural generalization of entity resolution. In what we call the "pure case" of MDs, any value from the underlying data domain can be used for the value in common that does the matching. We investigate the semantics and properties of data cleaning through the enforcement of matching dependencies for the pure case. We characterize the intended clean instances and also the "clean answers" to queries as those that are invariant under the cleaning process. The complexity of computing clean instances and clean answers to queries is investigated. Tractable and intractable cases depending on the MDs and queries are identified. Finally, we establish connections with database "repairs" under integrity constraints.

Connected through hyperedge HE-1 (induced by source paper "principles of progress indicators for database repairing"):
  with members:
    - "measuring and computing database inconsistency via repairs"
    - "research directions for principles of data management dagstuhl perspectives workshop 16151"
    - "holoclean holistic data repairs with probabilistic inference"
    - "computing optimal repairs for functional dependencies"
    - "complexity of consistent query answering in databases under cardinality based and incremental repair semantics"

Connected through hyperedge HE-2 (induced by source paper "query answering under matching dependencies for data cleaning complexity and algorithms"):
  with members:
    - "data cleaning and query answering with matching dependencies and matching functions"
    - "complexity of consistent query answering in databases under cardinality based and incremental repair semantics"
    - "answer sets for consistent query answering in inconsistent databases"
    - "minimal change integrity maintenance using tuple deletions"

Connected through hyperedge HE-3 (induced by source paper "data cleaning and query answering with matching dependencies and matching functions"):
  with members:
    - "answer sets for consistent query answering in inconsistent databases"

Question: Please tell me which class the center node 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)