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 hunt for a red spider conjunctive query determinacy is undecidable"
  Abstract: We solve a well known, long-standing open problem in relational databases theory, showing that the conjunctive query determinacy problem (in its "unrestricted" version) is undecidable.

Connected through hyperedge HE-1 (induced by source paper "on monotonic determinacy and rewritability for recursive queries and views"):
  with members:
    - "can one escape red chains regular path queries determinacy is undecidable"
    - "definability and interpolation within decidable fixpoint logics"
    - "red spider meets a rainworm conjunctive query finite determinacy is undecidable"
    - "datalog rewritings of regular path queries using views"

Connected through hyperedge HE-2 (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"
    - "datalog rewritings of regular path queries using views"
    - "the view update problem revisited"

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

Connected through hyperedge HE-4 (induced by source paper "querying visible and invisible tables in the presence of integrity constraints"):
  with members:
    - "obtaining information about queries behind views and dependencies"
    - "querying the guarded fragment"

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)