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 "preservation and decomposition theorems for bounded degree structures"):
  Abstract: We provide elementary algorithms for two preservation theorems for#N#first-order sentences (FO) on the class \^ad of all finite structures of degree#N#at most d: For each FO-sentence that is preserved under extensions#N#(homomorphisms) on \^ad, a \^ad-equivalent existential (existential-positive)#N#FO-sentence can be constructed in 5-fold (4-fold) exponential time. This is#N#complemented by lower bounds showing that a 3-fold exponential blow-up of the#N#computed existential (existential-positive) sentence is unavoidable. Both#N#algorithms can be extended (while maintaining the upper and lower bounds on#N#their time complexity) to input first-order sentences with modulo m counting#N#quantifiers (FO+MODm). Furthermore, we show that for an input FO-formula, a#N#\^ad-equivalent Feferman-Vaught decomposition can be computed in 3-fold#N#exponential time. We also provide a matching lower bound.

Includes members:
  Member "an optimal construction of hanf sentences":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parameterized synthesis for fragments of first order logic over data words")
  Member "algorithmic meta theorems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi wideness")

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)