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 "model checking for successor invariant first order formulas on graph classes of bounded expansion"):
  Abstract: A successor-invariant first-order formula is a formula that has access to an auxiliary successor relation on a structure's universe, but the model relation is independent of the particular interpretation of this relation. It is well known that successor-invariant formulas are more expressive on finite structures than plain first-order formulas without a successor relation. This naturally raises the question whether this increase in expressive power comes at an extra cost to solve the model-checking problem, that is, the problem to decide whether a given structure together with some (and hence every) successor relation is a model of a given formula. It was shown earlier that adding successor-invariance to first-order logic essentially comes at no extra cost for the model-checking problem on classes of finite structures whose underlying Gaifman graph is planar [Engelmann et al., 2012], excludes a fixed minor [Eickmeyer et al., 2013] or a fixed topological minor [Eickmeyer and Kawarabayashi, 2016; Kreutzer et al., 2016]. In this work we show that the model-checking problem for successor-invariant formulas is fixed-parameter tractable on any class of finite structures whose underlying Gaifman graphs form a class of bounded expansion. Our result generalises all earlier results and comes close to the best tractability results on nowhere dense classes of graphs currently known for plain first-order logic.

Includes members:
  Member "a new perspective on fo model checking of dense graph classes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "first order interpretations of bounded expansion classes")
  Member "the generalised colouring numbers on classes of bounded expansion":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a general kernelization technique for domination and independence problems in sparse classes")
  Member "order invariance on decomposable structures":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "model checking on ordered structures")
  Member "successor invariant first order logic on graphs with excluded topological subgraphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "model checking on ordered structures")
  Member "fo model checking of interval graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a new perspective on fo model checking of dense graph classes")
  Member "deciding first order properties of nowhere dense graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hitting topological minors is fpt")
  Member "structure theorem and isomorphism test for graphs with excluded topological subgraphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hypergraph isomorphism for groups with restricted composition factors")
  Member "lower bounds for the complexity of monadic second order logic":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "model checking on ordered structures")

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)