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: "consistency and trust in peer data exchange systems"
  Abstract: We propose and investigate a semantics for "peer data exchange systems" where different peers are related by data exchange constraints and trust relationships. These two elements plus the data at the peers' sites and their local integrity constraints are made compatible via a semantics that characterizes sets of "solution instances" for the peers. They are the intended -possibly virtual- instances for a peer that are obtained through a data repair semantics that we introduce and investigate. The semantically correct answers from a peer to a query, the so-called "peer consistent answers", are defined as those answers that are invariant under all its different solution instances. We show that solution instances can be specified as the models of logic programs with a stable model semantics. The repair semantics is based on null values as used in SQL databases, and is also of independent interest for repairs of single databases with respect to integrity constraints.

Connected through hyperedge HE-1 (induced by source paper "a logic framework for p2p deductive databases"):
  with members:
    - "distributed reasoning in a peer to peer setting application to the semantic web"
    - "query answering in peer to peer data exchange systems"
    - "a framework for compiling preferences in logic programs"
    - "on the problem of computing the well founded semantics"

Connected through hyperedge HE-2 (induced by source paper "repair based degrees of database inconsistency computation and complexity"):
  with members:
    - "computing optimal repairs for functional dependencies"
    - "juggling functions inside a database"
    - "achieving data privacy through secrecy views and null based virtual updates"
    - "the complexity of causality and responsibility for query answers and non answers"
    - "prioritized repairing and consistent query answering in relational databases"
    - "the dlv system for knowledge representation and reasoning"
    - "complexity of consistent query answering in databases under cardinality based and incremental repair semantics"
    - "minimal change integrity maintenance using tuple deletions"

Connected through hyperedge HE-3 (induced by source paper "the causality repair connection in databases causality programs"):
  with members:
    - "quantifying causal effects on query answering in databases"
    - "causes for query answers from databases datalog abduction view updates and integrity constraints"
    - "achieving data privacy through secrecy views and null based virtual updates"
    - "the complexity of causality and responsibility for query answers and non answers"
    - "design and implementation of aggregate functions in the dlv system"
    - "the dlv system for knowledge representation and reasoning"
    - "responsibility and blame a structural model approach"
    - "answer sets for consistent query answering in inconsistent databases"

Connected through hyperedge HE-4 (induced by source paper "specifying and computing causes for query answers in databases via database repairs and repair programs"):
  with members:
    - "measuring and computing database inconsistency via repairs"
    - "quantifying causal effects on query answering in databases"
    - "achieving data privacy through secrecy views and null based virtual updates"
    - "the complexity of causality and responsibility for query answers and non answers"
    - "prioritized repairing and consistent query answering in relational databases"
    - "the dlv system for knowledge representation and reasoning"
    - "complexity of consistent query answering in databases under cardinality based and incremental repair semantics"
    - "minimal change integrity maintenance using tuple deletions"

Connected through hyperedge HE-5 (induced by source paper "contexts and data quality assessment"):
  with members:
    - "composition and inversion of schema mappings"
    - "query answering in peer to peer data exchange systems"

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)