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: "dynamic conjunctive queries"
  Abstract: The article investigates classes of queries maintainable by conjunctive queries (CQs) and their extensions and restrictions in the dynamic complexity framework of Patnaik and Immerman. Starting from the basic language of quantifier-free conjunctions of positive atoms, it studies the impact of additional operators and features - such as union, atomic negation and quantification - on the dynamic expressiveness, for the standard semantics as well as for Delta-semantics. #R##N#Although many different combinations of these features are possible, they basically yield five important fragments for the standard semantics, characterized by the addition of (1) arbitrary quantification and atomic negation, (2) existential quantification and atomic negation, (3) existential quantification, (4) atomic negation (but no quantification), and by (5) no addition to the basic language at all. While fragments (3), (4) and (5) can be separated, it remains open whether fragments (1), (2) and (3) are actually different. The fragments arising from Delta-semantics are also subsumed by the standard fragments (1), (2) and (4). The main fragments of DynFO that had been studied in previous work, DynQF and DynProp, characterized by quantifier-free update programs with or without auxiliary functions, respectively, also fit into this hierarchy: DynProp coincides with fragment (4) and DynQF is strictly above fragment (4) and within fragment (3). #R##N#As a further result, all (statically) FO-definable queries are captured by fragment (2) and a complete characterization of these queries in terms of non-recursive dynamic programs with existential update formulas with one existential quantifier is given.

Connected through hyperedge HE-1 (induced by source paper "dynamic complexity of document spanners"):
  with members:
    - "complexity bounds for relational algebra over document spanners"
    - "constant delay enumeration for nondeterministic document spanners"
    - "split correctness in information extraction"
    - "constant delay algorithms for regular document spanners"
    - "document spanners for extracting incomplete information expressiveness and complexity"
    - "recursive programs for document spanners"
    - "dynamic graph queries"

Connected through hyperedge HE-2 (induced by source paper "answering conjunctive queries under updates"):
  with members:
    - "answering fo mod queries under updates on bounded degree databases"
    - "size bounds and query plans for relational joins"
    - "faster online matrix vector multiplication"
    - "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture"
    - "joins via geometric resolutions worst case and beyond"
    - "a trichotomy in the complexity of counting answers to conjunctive queries"
    - "structural tractability of counting of solutions to conjunctive queries"
    - "beyond worst case analysis for joins with minesweeper"

Connected through hyperedge HE-3 (induced by source paper "dynamic complexity under definable changes"):
  with members:
    - "reachability and distances under multiple changes"
    - "gmark schema driven generation of graphs and queries"
    - "a strategy for dynamic programs start over and muddle through"
    - "the dynamic descriptive complexity of k clique"
    - "reachability is in dynfo"
    - "on the quantifier free dynamic complexity of reachability"
    - "dbtoaster higher order delta processing for dynamic frequently fresh views"

Connected through hyperedge HE-4 (induced by source paper "answering ucqs under updates and in the presence of integrity constraints"):
  with members:
    - "answering conjunctive queries under updates"
    - "computing join queries with functional dependencies"
    - "incremental view maintenance for collection programming"
    - "a trichotomy in the complexity of counting answers to conjunctive queries"
    - "structural tractability of counting of solutions to conjunctive queries"
    - "tractable hypergraph properties for constraint satisfaction and conjunctive queries"

Connected through hyperedge HE-5 (induced by source paper "the dynamic descriptive complexity of k clique"):
  with members:
    - "on the quantifier free dynamic complexity of reachability"

Connected through hyperedge HE-6 (induced by source paper "on the quantifier free dynamic complexity of reachability"):
  with members:
    - "multiply recursive upper bounds with higman s lemma"

Connected through hyperedge HE-7 (induced by source paper "incremental view maintenance for collection programming"):
  with members:
    - "dbtoaster higher order delta processing for dynamic frequently fresh views"
    - "on the complexity of nonrecursive xquery and functional query languages on complex values"

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.LO(Logic in Computer Science)