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: "consistent query answers on numerical databases under aggregate constraints"
  Abstract: The problem of extracting consistent information from relational databases violating integrity constraints on numerical data is addressed. In particular, aggregate constraints defined as linear inequalities on aggregate-sum queries on input data are considered. The notion of repair as consistent set of updates at attribute-value level is exploited, and the characterization of several complexity issues related to repairing data and computing consistent query answers is provided.

Connected through hyperedge HE-1 (induced by source paper "complexity of consistent query answering in databases under cardinality based and incremental repair semantics extended version"):
  with members:
    - "minimal change integrity maintenance using tuple deletions"

Connected through hyperedge HE-2 (induced by source paper "matching dependencies with arbitrary attribute values semantics query answering and integrity constraints"):
  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 "complexity of consistent query answering in databases under cardinality based and incremental repair semantics"):
  with members:
    - "the dlv system for knowledge representation and reasoning"
    - "complexity and approximation of fixing numerical attributes in databases under integrity constraints"
    - "answer sets for consistent query answering in inconsistent databases"
    - "minimal change integrity maintenance using tuple deletions"

Connected through hyperedge HE-4 (induced by source paper "complexity and approximation of fixing numerical attributes in databases under integrity constraints"):
  with members:
    - "minimal change integrity maintenance using tuple deletions"

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)