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: "the view update problem revisited"
  Abstract: In this paper, we revisit the view update problem in a relational setting and propose a framework based on the notion of determinacy under constraints. Within such a framework, we characterise when a view mapping is invertible, establishing that this is the case precisely when each database symbol has an exact rewriting in terms of the view symbols under the given constraints, and we provide a general effective criterion to understand whether the changes introduced by a view update can be propagated to the underlying database relations in a unique and unambiguous way. #R##N#Afterwards, we show how determinacy under constraints can be checked, and rewritings effectively found, in three different relevant scenarios in the absence of view constraints. First, we settle the long-standing open issue of how to solve the view update problem in a multi-relational database with views that are projections of joins of relations, and we do so in a more general setting where views are defined by arbitrary conjunctive queries and database constraints are stratified embedded dependencies. Next, we study a setting based on horizontal decompositions of a single database relation, where views are defined by selections on possibly interpreted attributes (e.g., arithmetic comparisons) in the presence of domain constraints over the database schema. Lastly, we look into another multi-relational database setting, where views are defined in an expressive "Type" Relational Algebra based on the n-ary Description Logic DLR and database constraints are inclusions of expressions in that algebra.

Connected through hyperedge HE-1 (induced by source paper "can one escape red chains regular path queries determinacy is undecidable"):
  with members:
    - "red spider meets a rainworm conjunctive query finite determinacy is undecidable"
    - "the hunt for a red spider conjunctive query determinacy is undecidable"
    - "datalog rewritings of regular path queries using views"

Connected through hyperedge HE-2 (induced by source paper "red spider meets a rainworm conjunctive query finite determinacy is undecidable"):
  with members:
    - "the hunt for a red spider conjunctive query determinacy is undecidable"
    - "datalog rewritings of regular path queries using views"
    - "querying the guarded fragment"
    - "converging to the chase a tool for finite controllability"

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)