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 "the theory of concatenation over finite models"):
  Abstract: We propose FC, a logic on words that combines the previous approaches of finite-model theory and the theory of concatenation. It has immediate applications to spanners, a formalism for extracting structured data from text that has recently received considerable attention in database theory. In fact, FC is designed to be to spanners what FO is to relational databases. #R##N#Like the theory of concatenation, FC is built around word equations; in contrast to it, its semantics are defined to only allow finite models, by limiting the universe to a word and all its subwords. As a consequence of this, FC has many of the desirable properties of FO[<], while being far more expressive. Most noteworthy among these desirable properties are sufficient criteria for efficient model checking and capturing various complexity classes by extending the logic with appropriate closure or iteration operators. #R##N#These results allow us to obtain new insights into and techniques for the expressive power and efficient evaluation of spanners. More importantly, FC provides us with a general framework for logic on words that has potential applications far beyond spanners.

Includes members:
  Member "dynamic complexity of document spanners":
    also connected through other hyperedges:
      (none)
  Member "matching patterns with variables":
    also connected through other hyperedges:
      (none)
  Member "weight annotation in information extraction":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "grammars for document spanenrs")
  Member "constant delay enumeration for nondeterministic document spanners":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "grammars for document spanenrs")
  Member "split correctness in information extraction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "grammars for document spanenrs")
  Member "deterministic regular expressions with back references":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "conjunctive regular path queries with string variables")
  Member "constant delay algorithms for regular document spanners":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "grammars for document spanenrs")
  Member "the hardness of solving simple word equations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "matching patterns with variables")

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)