human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "deciding first order properties of nowhere dense graphs"):
  Abstract: Nowhere dense graph classes, introduced by Nesetril and Ossona de Mendez, form a large variety of classes of "sparse graphs" including the class of planar graphs, actually all classes with excluded minors, and also bounded degree graphs and graph classes of bounded expansion. #R##N#We show that deciding properties of graphs definable in first-order logic is fixed-parameter tractable on nowhere dense graph classes. At least for graph classes closed under taking subgraphs, this result is optimal: it was known before that for all classes C of graphs closed under taking subgraphs, if deciding first-order properties of graphs in C is fixed-parameter tractable, then C must be nowhere dense (under a reasonable complexity theoretic assumption). #R##N#As a by-product, we give an algorithmic construction of sparse neighbourhood covers for nowhere dense graphs. This extends and improves previous constructions of neighbourhood covers for graph classes with excluded minors. At the same time, our construction is considerably simpler than those. Our proofs are based on a new game-theoretic characterisation of nowhere dense graphs that allows for a recursive version of locality-based algorithms on these classes. On the logical side, we prove a "rank-preserving" version of Gaifman's locality theorem.

Includes members:
  Member "fo model checking on posets of bounded width":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "first order interpretations of bounded expansion classes")
  Member "lower bounds for the complexity of monadic second order logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "model checking on ordered structures")
  Member "domination problems in nowhere dense classes of graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reconfiguration on sparse graphs")
  Member "on brambles grid like minors and parameterized intractability of monadic second order logic":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "model checking for successor invariant first order formulas on graph classes of bounded expansion")
  Member "algorithmic meta theorems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "nowhere dense graph classes and algorithmic applications a tutorial at highlights of logic games and automata 2019")
  Member "homomorphism preservation on quasi wide classes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi wideness")
  Member "deciding first order properties of locally tree decomposable structures":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hitting topological minors is fpt")
  Member "fixed parameter tractability definability and model checking":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "nowhere dense graph classes and algorithmic applications a tutorial at highlights of logic games and automata 2019")

Question: Please tell me which class the source paper 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)